./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:37:59,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:37:59,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:37:59,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:37:59,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:37:59,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:37:59,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:37:59,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:37:59,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:37:59,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:37:59,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:37:59,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:37:59,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:37:59,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:37:59,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:37:59,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:37:59,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:37:59,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:37:59,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:37:59,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:37:59,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:37:59,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:37:59,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:37:59,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:37:59,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:37:59,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:37:59,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:37:59,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:37:59,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:37:59,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:37:59,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:37:59,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:37:59,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:37:59,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:37:59,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:37:59,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:37:59,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:37:59,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:37:59,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:37:59,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:37:59,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:37:59,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:37:59,634 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-08 19:37:59,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:37:59,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:37:59,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:37:59,890 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:37:59,891 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:37:59,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-08 19:38:01,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:38:01,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:38:01,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-08 19:38:01,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2c6102b/55906af6418b4a32a3c83c0500b3600d/FLAG201c90691 [2024-11-08 19:38:01,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2c6102b/55906af6418b4a32a3c83c0500b3600d [2024-11-08 19:38:01,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:38:01,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:38:01,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:38:01,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:38:01,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:38:01,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@868cf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01, skipping insertion in model container [2024-11-08 19:38:01,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:38:01,668 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_codestructure_normal_file-66.i[913,926] [2024-11-08 19:38:01,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:38:01,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:38:01,758 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_codestructure_normal_file-66.i[913,926] [2024-11-08 19:38:01,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:38:01,815 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:38:01,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01 WrapperNode [2024-11-08 19:38:01,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:38:01,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:38:01,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:38:01,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:38:01,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,881 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-08 19:38:01,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:38:01,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:38:01,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:38:01,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:38:01,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,911 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-08 19:38:01,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:38:01,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:38:01,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:38:01,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:38:01,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (1/1) ... [2024-11-08 19:38:01,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:38:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:38:01,979 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-08 19:38:01,985 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-08 19:38:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:38:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:38:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:38:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:38:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:38:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:38:02,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:38:02,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:38:02,408 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:38:02,408 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:38:02,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:38:02,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:38:02,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:38:02 BoogieIcfgContainer [2024-11-08 19:38:02,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:38:02,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:38:02,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:38:02,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:38:02,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:38:01" (1/3) ... [2024-11-08 19:38:02,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfa4e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:38:02, skipping insertion in model container [2024-11-08 19:38:02,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:01" (2/3) ... [2024-11-08 19:38:02,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfa4e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:38:02, skipping insertion in model container [2024-11-08 19:38:02,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:38:02" (3/3) ... [2024-11-08 19:38:02,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-08 19:38:02,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:38:02,442 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:38:02,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:38:02,507 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;@50091f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:38:02,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:38:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:38:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:38:02,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:02,524 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:02,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:02,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1412883533, now seen corresponding path program 1 times [2024-11-08 19:38:02,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:38:02,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346031065] [2024-11-08 19:38:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:38:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:38:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:38:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:38:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:38:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:38:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:38:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:38:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:38:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:38:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:38:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:38:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:38:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:38:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:38:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:38:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:38:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:38:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:38:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:38:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:38:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:38:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:38:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:38:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:38:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:38:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:38:02,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:38:02,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346031065] [2024-11-08 19:38:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346031065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:38:02,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:38:02,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:38:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468739026] [2024-11-08 19:38:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:38:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:38:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:38:02,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:38:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:38:02,958 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:38:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:38:02,981 INFO L93 Difference]: Finished difference Result 133 states and 240 transitions. [2024-11-08 19:38:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:38:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-08 19:38:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:38:02,990 INFO L225 Difference]: With dead ends: 133 [2024-11-08 19:38:02,990 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 19:38:02,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-08 19:38:02,997 INFO L432 NwaCegarLoop]: 103 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, 103 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-08 19:38:02,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:38:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 19:38:03,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 19:38:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:38:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-11-08 19:38:03,037 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 160 [2024-11-08 19:38:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:38:03,038 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-11-08 19:38:03,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:38:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-11-08 19:38:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:38:03,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:03,041 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:03,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:38:03,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2025399539, now seen corresponding path program 1 times [2024-11-08 19:38:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:38:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346327708] [2024-11-08 19:38:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:38:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:38:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:38:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:38:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:38:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:38:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:38:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:38:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:38:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:38:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:38:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:38:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:38:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:38:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:38:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:38:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:38:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:38:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:38:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:38:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:38:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:38:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:38:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:38:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:38:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:38:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:38:19,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:38:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346327708] [2024-11-08 19:38:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346327708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:38:19,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:38:19,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:38:19,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670475464] [2024-11-08 19:38:19,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:38:19,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:38:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:38:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:38:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:38:19,929 INFO L87 Difference]: Start difference. First operand 66 states and 103 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:38:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:38:21,098 INFO L93 Difference]: Finished difference Result 123 states and 185 transitions. [2024-11-08 19:38:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:38:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-11-08 19:38:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:38:21,100 INFO L225 Difference]: With dead ends: 123 [2024-11-08 19:38:21,100 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 19:38:21,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:38:21,102 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 134 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:38:21,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 469 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:38:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 19:38:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-11-08 19:38:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:38:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-11-08 19:38:21,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 160 [2024-11-08 19:38:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:38:21,145 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-11-08 19:38:21,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 19:38:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-11-08 19:38:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:38:21,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:21,151 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:21,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:38:21,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:21,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1345341169, now seen corresponding path program 1 times [2024-11-08 19:38:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:38:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139862078] [2024-11-08 19:38:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:38:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:38:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:38:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:38:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:38:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:38:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:38:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:38:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:38:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:38:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:38:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:38:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:38:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:38:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:38:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:38:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:38:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:38:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:38:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:38:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:38:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:38:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:38:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:38:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:38:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 19:38:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:38:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:38:21,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139862078] [2024-11-08 19:38:21,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139862078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:38:21,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:38:21,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:38:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510519953] [2024-11-08 19:38:21,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:38:21,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:38:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:38:21,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:38:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:38:21,536 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 19:38:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:38:21,732 INFO L93 Difference]: Finished difference Result 182 states and 286 transitions. [2024-11-08 19:38:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:38:21,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 160 [2024-11-08 19:38:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:38:21,734 INFO L225 Difference]: With dead ends: 182 [2024-11-08 19:38:21,734 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 19:38:21,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:38:21,736 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 138 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:38:21,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 150 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:38:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 19:38:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-08 19:38:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 69 states have internal predecessors, (95), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:38:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2024-11-08 19:38:21,749 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 160 [2024-11-08 19:38:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:38:21,749 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2024-11-08 19:38:21,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 19:38:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2024-11-08 19:38:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 19:38:21,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:21,751 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:21,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:38:21,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1649506112, now seen corresponding path program 1 times [2024-11-08 19:38:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:38:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636012610] [2024-11-08 19:38:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:38:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864192295] [2024-11-08 19:38:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:21,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:38:21,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:38:21,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:38:21,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:38:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:38:22,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:38:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:38:22,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:38:22,170 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:38:22,171 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:38:22,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:38:22,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:38:22,385 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:38:22,486 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:38:22,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:38:22 BoogieIcfgContainer [2024-11-08 19:38:22,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:38:22,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:38:22,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:38:22,489 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:38:22,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:38:02" (3/4) ... [2024-11-08 19:38:22,491 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:38:22,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:38:22,493 INFO L158 Benchmark]: Toolchain (without parser) took 21013.40ms. Allocated memory was 163.6MB in the beginning and 717.2MB in the end (delta: 553.6MB). Free memory was 92.0MB in the beginning and 365.5MB in the end (delta: -273.6MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,493 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 113.3MB in the end (delta: 213.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.01ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 76.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.72ms. Allocated memory is still 163.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,494 INFO L158 Benchmark]: Boogie Preprocessor took 60.74ms. Allocated memory is still 163.6MB. Free memory was 72.8MB in the beginning and 68.4MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,494 INFO L158 Benchmark]: RCFGBuilder took 473.61ms. Allocated memory was 163.6MB in the beginning and 226.5MB in the end (delta: 62.9MB). Free memory was 68.1MB in the beginning and 185.7MB in the end (delta: -117.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,495 INFO L158 Benchmark]: TraceAbstraction took 20066.09ms. Allocated memory was 226.5MB in the beginning and 717.2MB in the end (delta: 490.7MB). Free memory was 184.6MB in the beginning and 366.6MB in the end (delta: -182.0MB). Peak memory consumption was 308.8MB. Max. memory is 16.1GB. [2024-11-08 19:38:22,495 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 717.2MB. Free memory was 366.6MB in the beginning and 365.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:38:22,496 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.18ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 113.3MB in the end (delta: 213.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.01ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 76.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.72ms. Allocated memory is still 163.6MB. Free memory was 76.2MB in the beginning and 73.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.74ms. Allocated memory is still 163.6MB. Free memory was 72.8MB in the beginning and 68.4MB in the end (delta: 4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 473.61ms. Allocated memory was 163.6MB in the beginning and 226.5MB in the end (delta: 62.9MB). Free memory was 68.1MB in the beginning and 185.7MB in the end (delta: -117.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20066.09ms. Allocated memory was 226.5MB in the beginning and 717.2MB in the end (delta: 490.7MB). Free memory was 184.6MB in the beginning and 366.6MB in the end (delta: -182.0MB). Peak memory consumption was 308.8MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 717.2MB. Free memory was 366.6MB in the beginning and 365.5MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 16.5; [L27] signed char var_1_6 = 64; [L28] signed char var_1_7 = 2; [L29] unsigned short int var_1_8 = 256; [L30] unsigned char var_1_9 = 0; [L31] unsigned short int var_1_10 = 63583; [L32] unsigned short int var_1_11 = 33789; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] signed long int var_1_15 = 8; [L37] signed short int var_1_16 = -16; [L38] unsigned short int var_1_17 = 32; [L39] signed short int var_1_18 = 16; [L40] signed short int var_1_19 = 25; [L41] signed short int var_1_20 = 25; [L42] signed short int var_1_21 = 50; VAL [isInitial=0, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=0, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L90] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L92] var_1_4 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L104] var_1_10 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L105] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L107] var_1_11 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L108] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L110] var_1_13 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L111] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L113] var_1_14 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L123] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L49] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L50] COND TRUE \read(var_1_2) [L51] var_1_5 = 8.25 VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L54] COND FALSE !(-25 == var_1_6) [L59] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L61] COND TRUE var_1_8 >= var_1_7 [L62] var_1_12 = (! var_1_14) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L64] COND TRUE -64 > (var_1_6 + var_1_1) [L65] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L73] COND FALSE !(var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L76] COND TRUE var_1_1 < var_1_6 [L77] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=25, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L81] COND TRUE \read(var_1_13) [L82] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_2 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_2 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((var_1_2 && var_1_9) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_1)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_13 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-64, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-62, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 300 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 2742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:38:22,593 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:38:24,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:38:24,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:38:24,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:38:24,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:38:24,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:38:24,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:38:24,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:38:24,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:38:24,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:38:24,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:38:24,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:38:24,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:38:24,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:38:24,649 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:38:24,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:38:24,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:38:24,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:38:24,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:38:24,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:38:24,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:38:24,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:38:24,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:38:24,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:38:24,656 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:38:24,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:38:24,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:38:24,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:38:24,658 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:38:24,658 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:38:24,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:38:24,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:38:24,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:38:24,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:38:24,659 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-08 19:38:24,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:38:24,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:38:24,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:38:24,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:38:24,930 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:38:24,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-08 19:38:26,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:38:26,386 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:38:26,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-08 19:38:26,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8b1632e/af9df3e69b34451d841eab288544d96c/FLAG092a410f2 [2024-11-08 19:38:26,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8b1632e/af9df3e69b34451d841eab288544d96c [2024-11-08 19:38:26,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:38:26,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:38:26,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:38:26,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:38:26,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:38:26,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da346a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26, skipping insertion in model container [2024-11-08 19:38:26,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:38:26,611 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_codestructure_normal_file-66.i[913,926] [2024-11-08 19:38:26,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:38:26,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:38:26,698 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_codestructure_normal_file-66.i[913,926] [2024-11-08 19:38:26,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:38:26,751 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:38:26,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26 WrapperNode [2024-11-08 19:38:26,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:38:26,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:38:26,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:38:26,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:38:26,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,796 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-08 19:38:26,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:38:26,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:38:26,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:38:26,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:38:26,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,837 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-08 19:38:26,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:38:26,852 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:38:26,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:38:26,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:38:26,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (1/1) ... [2024-11-08 19:38:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:38:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:38:26,887 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-08 19:38:26,888 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-08 19:38:26,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:38:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:38:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:38:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:38:26,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:38:26,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:38:26,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:38:26,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:38:27,281 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:38:27,281 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:38:27,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:38:27,302 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:38:27,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:38:27 BoogieIcfgContainer [2024-11-08 19:38:27,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:38:27,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:38:27,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:38:27,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:38:27,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:38:26" (1/3) ... [2024-11-08 19:38:27,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f91d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:38:27, skipping insertion in model container [2024-11-08 19:38:27,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:38:26" (2/3) ... [2024-11-08 19:38:27,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f91d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:38:27, skipping insertion in model container [2024-11-08 19:38:27,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:38:27" (3/3) ... [2024-11-08 19:38:27,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-08 19:38:27,327 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:38:27,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:38:27,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:38:27,395 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;@55dd8de0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:38:27,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:38:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:38:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:38:27,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:27,412 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:27,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1412883533, now seen corresponding path program 1 times [2024-11-08 19:38:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:38:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216829281] [2024-11-08 19:38:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:38:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:38:27,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:38:27,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:38:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:27,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:38:27,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:38:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 19:38:27,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:38:27,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:38:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216829281] [2024-11-08 19:38:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216829281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:38:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:38:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:38:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947999411] [2024-11-08 19:38:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:38:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:38:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:38:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:38:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:38:27,711 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:38:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:38:27,740 INFO L93 Difference]: Finished difference Result 133 states and 240 transitions. [2024-11-08 19:38:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:38:27,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-08 19:38:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:38:27,750 INFO L225 Difference]: With dead ends: 133 [2024-11-08 19:38:27,750 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 19:38:27,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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-08 19:38:27,755 INFO L432 NwaCegarLoop]: 103 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, 103 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-08 19:38:27,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:38:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 19:38:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 19:38:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:38:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-11-08 19:38:27,798 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 160 [2024-11-08 19:38:27,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:38:27,798 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-11-08 19:38:27,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:38:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-11-08 19:38:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:38:27,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:38:27,801 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 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, 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-08 19:38:27,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:38:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:38:28,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:38:28,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:38:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2025399539, now seen corresponding path program 1 times [2024-11-08 19:38:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:38:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950749228] [2024-11-08 19:38:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:38:28,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:38:28,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:38:28,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:38:28,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:38:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:28,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 19:38:28,159 INFO L278 TraceCheckSpWp]: Computing forward predicates...