./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5f3ef2fb9cd0571dbcab4509830c8891a8d69d7e58533d6cefb8c79dfd0705c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:00:30,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:00:30,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:00:30,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:00:30,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:00:30,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:00:30,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:00:30,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:00:30,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:00:30,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:00:30,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:00:30,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:00:30,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:00:30,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:00:30,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:00:30,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:00:30,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:00:30,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:00:30,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:00:30,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:00:30,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:00:30,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:00:30,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:00:30,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:00:30,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:00:30,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:00:30,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:00:30,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:00:30,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:00:30,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:00:30,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:00:30,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:00:30,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:30,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:00:30,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:00:30,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:00:30,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:00:30,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:00:30,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:00:30,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:00:30,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:00:30,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:00:30,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5f3ef2fb9cd0571dbcab4509830c8891a8d69d7e58533d6cefb8c79dfd0705c [2024-11-20 06:00:30,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:00:30,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:00:30,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:00:30,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:00:30,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:00:30,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i [2024-11-20 06:00:32,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:00:32,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:00:32,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i [2024-11-20 06:00:32,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce08b61c/ace509ab40364e71a89fcba160b2781d/FLAG46825102d [2024-11-20 06:00:32,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce08b61c/ace509ab40364e71a89fcba160b2781d [2024-11-20 06:00:32,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:00:32,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:00:32,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:32,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:00:32,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:00:32,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c956ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32, skipping insertion in model container [2024-11-20 06:00:32,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:00:32,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i[916,929] [2024-11-20 06:00:32,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:32,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:00:32,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-21.i[916,929] [2024-11-20 06:00:32,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:00:32,934 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:00:32,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32 WrapperNode [2024-11-20 06:00:32,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:00:32,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:32,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:00:32,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:00:32,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,976 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-20 06:00:32,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:00:32,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:00:32,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:00:32,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:00:32,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:32,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:00:33,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:00:33,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:00:33,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:00:33,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:00:33,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (1/1) ... [2024-11-20 06:00:33,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:00:33,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:00:33,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:00:33,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:00:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:00:33,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:00:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:00:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:00:33,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:00:33,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:00:33,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:00:33,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:00:33,433 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 06:00:33,433 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:00:33,453 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:00:33,454 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:00:33,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:33 BoogieIcfgContainer [2024-11-20 06:00:33,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:00:33,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:00:33,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:00:33,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:00:33,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:00:32" (1/3) ... [2024-11-20 06:00:33,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b04734a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:33, skipping insertion in model container [2024-11-20 06:00:33,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:00:32" (2/3) ... [2024-11-20 06:00:33,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b04734a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:00:33, skipping insertion in model container [2024-11-20 06:00:33,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:33" (3/3) ... [2024-11-20 06:00:33,462 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-21.i [2024-11-20 06:00:33,479 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:00:33,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:00:33,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:00:33,544 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a33dfdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:00:33,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:00:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:00:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:00:33,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:33,558 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:00:33,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1187149162, now seen corresponding path program 1 times [2024-11-20 06:00:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:33,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703574445] [2024-11-20 06:00:33,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:00:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703574445] [2024-11-20 06:00:33,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703574445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:00:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225015758] [2024-11-20 06:00:33,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:00:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:34,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:00:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:00:34,012 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:00:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:34,041 INFO L93 Difference]: Finished difference Result 81 states and 136 transitions. [2024-11-20 06:00:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:00:34,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-20 06:00:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:34,052 INFO L225 Difference]: With dead ends: 81 [2024-11-20 06:00:34,052 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 06:00:34,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:00:34,061 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:34,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:00:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 06:00:34,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 06:00:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:00:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-11-20 06:00:34,113 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 78 [2024-11-20 06:00:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:34,114 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-11-20 06:00:34,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:00:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-11-20 06:00:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:00:34,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:34,120 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:00:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:00:34,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:34,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1652535958, now seen corresponding path program 1 times [2024-11-20 06:00:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494826086] [2024-11-20 06:00:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:00:36,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494826086] [2024-11-20 06:00:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494826086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:36,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:00:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920544240] [2024-11-20 06:00:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:00:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:00:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:00:36,211 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:36,679 INFO L93 Difference]: Finished difference Result 158 states and 224 transitions. [2024-11-20 06:00:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:00:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-20 06:00:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:36,682 INFO L225 Difference]: With dead ends: 158 [2024-11-20 06:00:36,683 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 06:00:36,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:00:36,684 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 127 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:36,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 353 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:00:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 06:00:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2024-11-20 06:00:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 63 states have internal predecessors, (77), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 06:00:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2024-11-20 06:00:36,703 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 78 [2024-11-20 06:00:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:36,703 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2024-11-20 06:00:36,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2024-11-20 06:00:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 06:00:36,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:36,705 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:00:36,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:00:36,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:36,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1288327348, now seen corresponding path program 1 times [2024-11-20 06:00:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035692318] [2024-11-20 06:00:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:00:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035692318] [2024-11-20 06:00:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035692318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:37,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:00:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987653242] [2024-11-20 06:00:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:00:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:00:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:00:37,707 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:38,297 INFO L93 Difference]: Finished difference Result 158 states and 218 transitions. [2024-11-20 06:00:38,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:00:38,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-20 06:00:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:38,300 INFO L225 Difference]: With dead ends: 158 [2024-11-20 06:00:38,300 INFO L226 Difference]: Without dead ends: 156 [2024-11-20 06:00:38,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:00:38,301 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 120 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:38,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 313 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:00:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-20 06:00:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2024-11-20 06:00:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 06:00:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 186 transitions. [2024-11-20 06:00:38,332 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 186 transitions. Word has length 80 [2024-11-20 06:00:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:38,334 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 186 transitions. [2024-11-20 06:00:38,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 186 transitions. [2024-11-20 06:00:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-20 06:00:38,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:38,337 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:00:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:00:38,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 53314000, now seen corresponding path program 1 times [2024-11-20 06:00:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383210824] [2024-11-20 06:00:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:00:39,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383210824] [2024-11-20 06:00:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383210824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:39,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:00:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722948883] [2024-11-20 06:00:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:39,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:00:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:00:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:00:39,490 INFO L87 Difference]: Start difference. First operand 132 states and 186 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:39,767 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2024-11-20 06:00:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:00:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-11-20 06:00:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:39,775 INFO L225 Difference]: With dead ends: 152 [2024-11-20 06:00:39,775 INFO L226 Difference]: Without dead ends: 150 [2024-11-20 06:00:39,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:00:39,776 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:00:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-20 06:00:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 129. [2024-11-20 06:00:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 83 states have internal predecessors, (98), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 06:00:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 182 transitions. [2024-11-20 06:00:39,805 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 182 transitions. Word has length 80 [2024-11-20 06:00:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:39,805 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 182 transitions. [2024-11-20 06:00:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 182 transitions. [2024-11-20 06:00:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-20 06:00:39,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:00:39,806 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:00:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:00:39,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:00:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:00:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1047881826, now seen corresponding path program 1 times [2024-11-20 06:00:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:00:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785104867] [2024-11-20 06:00:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:00:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:00:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:00:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:00:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:00:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:00:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:00:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:00:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:00:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:00:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:00:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:00:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:00:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:00:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:00:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:00:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:00:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785104867] [2024-11-20 06:00:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785104867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:00:40,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:00:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:00:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071534450] [2024-11-20 06:00:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:00:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:00:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:00:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:00:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:00:40,299 INFO L87 Difference]: Start difference. First operand 129 states and 182 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:00:40,780 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2024-11-20 06:00:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:00:40,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-20 06:00:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:00:40,782 INFO L225 Difference]: With dead ends: 164 [2024-11-20 06:00:40,782 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 06:00:40,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2024-11-20 06:00:40,783 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:00:40,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 415 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:00:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 06:00:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 06:00:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 06:00:40,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 06:00:40,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2024-11-20 06:00:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:00:40,785 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 06:00:40,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:00:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 06:00:40,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 06:00:40,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:00:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:00:40,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 06:00:40,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 06:00:41,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:00:41,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:00:41 BoogieIcfgContainer [2024-11-20 06:00:41,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:00:41,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:00:41,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:00:41,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:00:41,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:00:33" (3/4) ... [2024-11-20 06:00:41,200 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 06:00:41,203 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 06:00:41,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 06:00:41,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 06:00:41,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 06:00:41,206 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 06:00:41,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 06:00:41,277 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 06:00:41,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:00:41,278 INFO L158 Benchmark]: Toolchain (without parser) took 8686.38ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 90.5MB in the beginning and 202.8MB in the end (delta: -112.3MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,278 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:00:41,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.48ms. Allocated memory is still 159.4MB. Free memory was 90.4MB in the beginning and 118.3MB in the end (delta: -27.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.05ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,279 INFO L158 Benchmark]: Boogie Preprocessor took 45.81ms. Allocated memory is still 159.4MB. Free memory was 116.2MB in the beginning and 113.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,279 INFO L158 Benchmark]: RCFGBuilder took 430.38ms. Allocated memory is still 159.4MB. Free memory was 113.0MB in the beginning and 97.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,279 INFO L158 Benchmark]: TraceAbstraction took 7740.55ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 96.8MB in the beginning and 208.0MB in the end (delta: -111.3MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,279 INFO L158 Benchmark]: Witness Printer took 80.03ms. Allocated memory is still 327.2MB. Free memory was 208.0MB in the beginning and 202.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:00:41,280 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.48ms. Allocated memory is still 159.4MB. Free memory was 90.4MB in the beginning and 118.3MB in the end (delta: -27.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.05ms. Allocated memory is still 159.4MB. Free memory was 118.3MB in the beginning and 116.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.81ms. Allocated memory is still 159.4MB. Free memory was 116.2MB in the beginning and 113.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 430.38ms. Allocated memory is still 159.4MB. Free memory was 113.0MB in the beginning and 97.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7740.55ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 96.8MB in the beginning and 208.0MB in the end (delta: -111.3MB). Peak memory consumption was 160.8MB. Max. memory is 16.1GB. * Witness Printer took 80.03ms. Allocated memory is still 327.2MB. Free memory was 208.0MB in the beginning and 202.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 1331 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 980 mSDsCounter, 203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 203 mSolverCounterUnsat, 351 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((var_1_12 == 0) || ((32768 <= var_1_1) && (var_1_1 == (65536 + var_1_13)))) || ((var_1_1 <= 32767) && (var_1_1 == var_1_13))) && ((var_1_1 == last_1_var_1_13) || ((2 * last_1_var_1_13) < ((int) last_1_var_1_13 * last_1_var_1_13)))) && ((0 < (last_1_var_1_13 + 1)) || (((last_1_var_1_13 >= 0) ? (last_1_var_1_13 % 65536) : ((last_1_var_1_13 % 65536) + 65536)) == var_1_1))) || ((256 == last_1_var_1_13) && (256 == var_1_13))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_13 == \old(last_1_var_1_13))) RESULT: Ultimate proved your program to be correct! [2024-11-20 06:00:41,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE