./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:05:50,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:05:50,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:05:50,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:05:50,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:05:50,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:05:50,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:05:50,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:05:50,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:05:50,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:05:50,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:05:50,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:05:50,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:05:50,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:05:50,459 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:05:50,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:05:50,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:05:50,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:05:50,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:05:50,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:05:50,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:05:50,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:05:50,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:05:50,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:05:50,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:05:50,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:05:50,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:05:50,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:05:50,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:05:50,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:05:50,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:05:50,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:05:50,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:05:50,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:05:50,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:05:50,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:05:50,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:05:50,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:05:50,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:05:50,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:05:50,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:05:50,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:05:50,471 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 -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2024-11-20 08:05:50,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:05:50,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:05:50,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:05:50,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:05:50,750 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:05:50,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-20 08:05:52,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:05:52,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:05:52,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-20 08:05:52,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44578d39/25e6165e4f35483b96d8be532cfaa709/FLAG61953a707 [2024-11-20 08:05:52,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44578d39/25e6165e4f35483b96d8be532cfaa709 [2024-11-20 08:05:52,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:05:52,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:05:52,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:05:52,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:05:52,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:05:52,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72076a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52, skipping insertion in model container [2024-11-20 08:05:52,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:05:52,716 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_operatoramount_amount50_file-66.i[915,928] [2024-11-20 08:05:52,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:05:52,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:05:52,820 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_operatoramount_amount50_file-66.i[915,928] [2024-11-20 08:05:52,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:05:52,868 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:05:52,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52 WrapperNode [2024-11-20 08:05:52,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:05:52,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:05:52,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:05:52,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:05:52,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,919 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-20 08:05:52,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:05:52,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:05:52,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:05:52,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:05:52,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,963 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:05:52,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:05:52,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:05:52,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:05:52,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:05:52,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (1/1) ... [2024-11-20 08:05:52,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:05:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:05:53,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:05:53,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:05:53,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:05:53,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:05:53,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:05:53,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:05:53,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:05:53,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:05:53,159 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:05:53,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:05:53,447 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 08:05:53,447 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:05:53,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:05:53,461 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:05:53,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:05:53 BoogieIcfgContainer [2024-11-20 08:05:53,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:05:53,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:05:53,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:05:53,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:05:53,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:05:52" (1/3) ... [2024-11-20 08:05:53,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa929a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:05:53, skipping insertion in model container [2024-11-20 08:05:53,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:05:52" (2/3) ... [2024-11-20 08:05:53,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa929a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:05:53, skipping insertion in model container [2024-11-20 08:05:53,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:05:53" (3/3) ... [2024-11-20 08:05:53,470 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2024-11-20 08:05:53,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:05:53,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:05:53,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:05:53,583 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;@48617ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:05:53,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:05:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:05:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:05:53,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:05:53,605 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:05:53,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:05:53,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:05:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-20 08:05:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:05:53,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59295188] [2024-11-20 08:05:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:05:53,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:05:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:05:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:05:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:05:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:05:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:05:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:05:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:05:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:05:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:05:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:05:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:05:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:05:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:05:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:05:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:05:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:05:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:05:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:05:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:05:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:05:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:05:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59295188] [2024-11-20 08:05:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59295188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:05:58,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:05:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 08:05:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728356167] [2024-11-20 08:05:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:05:58,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 08:05:58,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:05:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 08:05:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:05:58,638 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:05:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:05:59,651 INFO L93 Difference]: Finished difference Result 236 states and 392 transitions. [2024-11-20 08:05:59,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:05:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:05:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:05:59,664 INFO L225 Difference]: With dead ends: 236 [2024-11-20 08:05:59,666 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 08:05:59,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:05:59,677 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 213 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 08:05:59,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 433 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 08:05:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 08:05:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2024-11-20 08:05:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 08:05:59,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-20 08:05:59,752 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-20 08:05:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:05:59,753 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-20 08:05:59,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:05:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-20 08:05:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:05:59,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:05:59,756 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:05:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:05:59,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:05:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:05:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 40097505, now seen corresponding path program 1 times [2024-11-20 08:05:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:05:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310089403] [2024-11-20 08:05:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:05:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:05:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310089403] [2024-11-20 08:06:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310089403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:04,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 08:06:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818483516] [2024-11-20 08:06:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:06:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:06:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:06:04,023 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:05,336 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2024-11-20 08:06:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 08:06:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:05,339 INFO L225 Difference]: With dead ends: 178 [2024-11-20 08:06:05,340 INFO L226 Difference]: Without dead ends: 176 [2024-11-20 08:06:05,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:06:05,341 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:05,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 534 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:06:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-20 08:06:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2024-11-20 08:06:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 08:06:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-20 08:06:05,358 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-20 08:06:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:05,359 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-20 08:06:05,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-20 08:06:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:05,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:05,361 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:06:05,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash 718308833, now seen corresponding path program 1 times [2024-11-20 08:06:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574075415] [2024-11-20 08:06:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574075415] [2024-11-20 08:06:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574075415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 08:06:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916840569] [2024-11-20 08:06:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:09,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 08:06:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 08:06:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-20 08:06:09,331 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:10,328 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2024-11-20 08:06:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 08:06:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:10,331 INFO L225 Difference]: With dead ends: 185 [2024-11-20 08:06:10,331 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 08:06:10,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-20 08:06:10,335 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:10,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 432 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:06:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 08:06:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2024-11-20 08:06:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 08:06:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-11-20 08:06:10,365 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2024-11-20 08:06:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-11-20 08:06:10,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-11-20 08:06:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:10,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:10,368 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:10,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:06:10,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:10,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 720155875, now seen corresponding path program 1 times [2024-11-20 08:06:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248054465] [2024-11-20 08:06:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248054465] [2024-11-20 08:06:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248054465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:14,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 08:06:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929100474] [2024-11-20 08:06:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:14,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 08:06:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 08:06:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:06:14,610 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:16,185 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-20 08:06:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 08:06:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:16,187 INFO L225 Difference]: With dead ends: 183 [2024-11-20 08:06:16,188 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 08:06:16,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-20 08:06:16,189 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 193 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:16,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 513 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 08:06:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 08:06:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 102. [2024-11-20 08:06:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 08:06:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-20 08:06:16,204 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-20 08:06:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-20 08:06:16,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-20 08:06:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:16,207 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:06:16,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash 296415901, now seen corresponding path program 1 times [2024-11-20 08:06:16,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:16,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903854416] [2024-11-20 08:06:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:16,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:16,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903854416] [2024-11-20 08:06:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903854416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:06:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358697508] [2024-11-20 08:06:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:06:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:06:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:06:16,287 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:16,331 INFO L93 Difference]: Finished difference Result 281 states and 422 transitions. [2024-11-20 08:06:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:06:16,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:16,335 INFO L225 Difference]: With dead ends: 281 [2024-11-20 08:06:16,336 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 08:06:16,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:06:16,338 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:16,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:06:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 08:06:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-20 08:06:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 08:06:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-20 08:06:16,365 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 119 [2024-11-20 08:06:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:16,365 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-20 08:06:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-20 08:06:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:16,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:16,368 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:16,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 08:06:16,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -512930725, now seen corresponding path program 1 times [2024-11-20 08:06:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426489700] [2024-11-20 08:06:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:16,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426489700] [2024-11-20 08:06:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426489700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:06:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701791509] [2024-11-20 08:06:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:16,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:06:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:06:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:06:16,509 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:16,681 INFO L93 Difference]: Finished difference Result 530 states and 761 transitions. [2024-11-20 08:06:16,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:06:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:16,688 INFO L225 Difference]: With dead ends: 530 [2024-11-20 08:06:16,688 INFO L226 Difference]: Without dead ends: 353 [2024-11-20 08:06:16,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:06:16,691 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:16,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 08:06:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-20 08:06:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 308. [2024-11-20 08:06:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 218 states have internal predecessors, (279), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 08:06:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 447 transitions. [2024-11-20 08:06:16,742 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 447 transitions. Word has length 119 [2024-11-20 08:06:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:16,745 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 447 transitions. [2024-11-20 08:06:16,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 447 transitions. [2024-11-20 08:06:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:16,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:16,747 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:16,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 08:06:16,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 167127645, now seen corresponding path program 1 times [2024-11-20 08:06:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:16,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101965273] [2024-11-20 08:06:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101965273] [2024-11-20 08:06:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101965273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:18,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 08:06:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878782677] [2024-11-20 08:06:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 08:06:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 08:06:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-20 08:06:18,625 INFO L87 Difference]: Start difference. First operand 308 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:19,641 INFO L93 Difference]: Finished difference Result 454 states and 614 transitions. [2024-11-20 08:06:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 08:06:19,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:19,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:19,646 INFO L225 Difference]: With dead ends: 454 [2024-11-20 08:06:19,648 INFO L226 Difference]: Without dead ends: 452 [2024-11-20 08:06:19,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:06:19,650 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 243 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:19,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 507 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 08:06:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-20 08:06:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2024-11-20 08:06:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-20 08:06:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-20 08:06:19,708 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-20 08:06:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:19,709 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-20 08:06:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-20 08:06:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:19,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:19,711 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:19,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 08:06:19,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:19,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash 168974687, now seen corresponding path program 1 times [2024-11-20 08:06:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:19,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203303377] [2024-11-20 08:06:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:23,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:23,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203303377] [2024-11-20 08:06:23,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203303377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:23,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:23,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 08:06:23,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426498975] [2024-11-20 08:06:23,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:23,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 08:06:23,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 08:06:23,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-20 08:06:23,076 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:24,470 INFO L93 Difference]: Finished difference Result 452 states and 612 transitions. [2024-11-20 08:06:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 08:06:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 08:06:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:24,476 INFO L225 Difference]: With dead ends: 452 [2024-11-20 08:06:24,476 INFO L226 Difference]: Without dead ends: 450 [2024-11-20 08:06:24,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-20 08:06:24,477 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 288 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:24,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 543 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 08:06:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-20 08:06:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 364. [2024-11-20 08:06:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-20 08:06:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-20 08:06:24,526 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-20 08:06:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:24,527 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-20 08:06:24,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 08:06:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-20 08:06:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:24,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:24,529 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 08:06:24,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:24,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash -548555551, now seen corresponding path program 1 times [2024-11-20 08:06:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401297696] [2024-11-20 08:06:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:06:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:06:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:06:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:06:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:06:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:06:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:06:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:06:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:06:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:06:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:06:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:06:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 08:06:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:06:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 08:06:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 08:06:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 08:06:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 08:06:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 08:06:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401297696] [2024-11-20 08:06:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401297696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:06:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:06:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 08:06:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745976086] [2024-11-20 08:06:24,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:06:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 08:06:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:24,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 08:06:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 08:06:24,835 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:06:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:25,079 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2024-11-20 08:06:25,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 08:06:25,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-20 08:06:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:25,083 INFO L225 Difference]: With dead ends: 689 [2024-11-20 08:06:25,083 INFO L226 Difference]: Without dead ends: 371 [2024-11-20 08:06:25,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 08:06:25,086 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:25,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:06:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-20 08:06:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-20 08:06:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 257 states have internal predecessors, (311), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 08:06:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 503 transitions. [2024-11-20 08:06:25,129 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 503 transitions. Word has length 119 [2024-11-20 08:06:25,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:25,130 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 503 transitions. [2024-11-20 08:06:25,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 08:06:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 503 transitions. [2024-11-20 08:06:25,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 08:06:25,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:25,132 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:25,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 08:06:25,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:25,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 306968243, now seen corresponding path program 1 times [2024-11-20 08:06:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527542399] [2024-11-20 08:06:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:06:25,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840095547] [2024-11-20 08:06:25,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:06:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:06:25,226 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-20 08:06:25,229 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-20 08:06:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:25,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:06:25,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:06:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 93 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-20 08:06:26,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:06:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:06:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527542399] [2024-11-20 08:06:27,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 08:06:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840095547] [2024-11-20 08:06:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840095547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:06:27,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 08:06:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-20 08:06:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924044224] [2024-11-20 08:06:27,209 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 08:06:27,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 08:06:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:06:27,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 08:06:27,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-20 08:06:27,211 INFO L87 Difference]: Start difference. First operand 362 states and 503 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-20 08:06:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:06:28,035 INFO L93 Difference]: Finished difference Result 985 states and 1261 transitions. [2024-11-20 08:06:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-20 08:06:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 120 [2024-11-20 08:06:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:06:28,041 INFO L225 Difference]: With dead ends: 985 [2024-11-20 08:06:28,041 INFO L226 Difference]: Without dead ends: 667 [2024-11-20 08:06:28,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 08:06:28,044 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:06:28,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 285 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:06:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-20 08:06:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 553. [2024-11-20 08:06:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 386 states have (on average 1.1580310880829014) internal successors, (447), 397 states have internal predecessors, (447), 124 states have call successors, (124), 42 states have call predecessors, (124), 42 states have return successors, (124), 113 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-20 08:06:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 695 transitions. [2024-11-20 08:06:28,129 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 695 transitions. Word has length 120 [2024-11-20 08:06:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:06:28,130 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 695 transitions. [2024-11-20 08:06:28,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-20 08:06:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 695 transitions. [2024-11-20 08:06:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 08:06:28,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:28,131 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:28,143 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-20 08:06:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 08:06:28,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:28,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:28,333 INFO L85 PathProgramCache]: Analyzing trace with hash 308815285, now seen corresponding path program 1 times [2024-11-20 08:06:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:06:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211909266] [2024-11-20 08:06:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:06:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:06:28,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080637287] [2024-11-20 08:06:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:06:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:06:28,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:06:28,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:06:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:06:28,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:06:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:06:28,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:06:28,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:06:28,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:06:28,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 08:06:28,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-20 08:06:28,847 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:28,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:06:28,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:06:28 BoogieIcfgContainer [2024-11-20 08:06:28,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:06:28,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:06:28,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:06:28,940 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:06:28,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:05:53" (3/4) ... [2024-11-20 08:06:28,943 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:06:28,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:06:28,944 INFO L158 Benchmark]: Toolchain (without parser) took 36460.01ms. Allocated memory was 176.2MB in the beginning and 509.6MB in the end (delta: 333.4MB). Free memory was 118.6MB in the beginning and 418.6MB in the end (delta: -300.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-20 08:06:28,945 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:06:28,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.97ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 103.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 08:06:28,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.35ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 100.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 08:06:28,945 INFO L158 Benchmark]: Boogie Preprocessor took 67.42ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 95.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:06:28,945 INFO L158 Benchmark]: RCFGBuilder took 473.24ms. Allocated memory is still 176.2MB. Free memory was 95.5MB in the beginning and 75.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 08:06:28,946 INFO L158 Benchmark]: TraceAbstraction took 35475.77ms. Allocated memory was 176.2MB in the beginning and 509.6MB in the end (delta: 333.4MB). Free memory was 75.3MB in the beginning and 418.6MB in the end (delta: -343.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:06:28,946 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 509.6MB. Free memory is still 418.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:06:28,947 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.16ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.97ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 103.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.35ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 100.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.42ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 95.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 473.24ms. Allocated memory is still 176.2MB. Free memory was 95.5MB in the beginning and 75.9MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35475.77ms. Allocated memory was 176.2MB in the beginning and 509.6MB in the end (delta: 333.4MB). Free memory was 75.3MB in the beginning and 418.6MB in the end (delta: -343.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 509.6MB. Free memory is still 418.6MB. 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 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, 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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, 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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, 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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=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=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49279, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (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_19)) ? (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_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (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_12 ? (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, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.3s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 3898 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3381 IncrementalHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 933 mSDtfsCounter, 3381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 650 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1181 ConstructedInterpolants, 1 QuantifiedInterpolants, 12305 SizeOfPredicates, 7 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6027/6120 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-20 08:06:29,106 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_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 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:06:31,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:06:31,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:06:31,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:06:31,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:06:31,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:06:31,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:06:31,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:06:31,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:06:31,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:06:31,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:06:31,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:06:31,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:06:31,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:06:31,360 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:06:31,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:06:31,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:06:31,361 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:06:31,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:06:31,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:06:31,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:06:31,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:06:31,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:06:31,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:06:31,367 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:06:31,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:06:31,367 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:06:31,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:06:31,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:06:31,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:06:31,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:06:31,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:06:31,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:06:31,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:06:31,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:06:31,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:06:31,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:06:31,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:06:31,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:06:31,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:06:31,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:06:31,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:06:31,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:06:31,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:06:31,372 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 -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2024-11-20 08:06:31,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:06:31,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:06:31,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:06:31,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:06:31,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:06:31,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-20 08:06:33,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:06:33,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:06:33,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-20 08:06:33,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031b5d819/64ff6372e3dc496c9150c316aad9a300/FLAG4003895c3 [2024-11-20 08:06:33,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031b5d819/64ff6372e3dc496c9150c316aad9a300 [2024-11-20 08:06:33,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:06:33,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:06:33,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:06:33,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:06:33,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:06:33,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d7f8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33, skipping insertion in model container [2024-11-20 08:06:33,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:06:33,708 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_operatoramount_amount50_file-66.i[915,928] [2024-11-20 08:06:33,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:06:33,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:06:33,807 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_operatoramount_amount50_file-66.i[915,928] [2024-11-20 08:06:33,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:06:33,876 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:06:33,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33 WrapperNode [2024-11-20 08:06:33,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:06:33,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:06:33,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:06:33,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:06:33,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,936 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-20 08:06:33,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:06:33,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:06:33,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:06:33,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:06:33,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,970 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:06:33,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:33,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:34,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:34,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:06:34,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:06:34,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:06:34,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:06:34,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (1/1) ... [2024-11-20 08:06:34,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:06:34,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:06:34,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:06:34,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:06:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:06:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:06:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:06:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:06:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:06:34,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:06:34,164 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:06:34,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:06:34,539 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 08:06:34,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:06:34,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:06:34,557 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:06:34,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:06:34 BoogieIcfgContainer [2024-11-20 08:06:34,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:06:34,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:06:34,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:06:34,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:06:34,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:06:33" (1/3) ... [2024-11-20 08:06:34,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baee18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:06:34, skipping insertion in model container [2024-11-20 08:06:34,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:06:33" (2/3) ... [2024-11-20 08:06:34,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baee18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:06:34, skipping insertion in model container [2024-11-20 08:06:34,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:06:34" (3/3) ... [2024-11-20 08:06:34,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2024-11-20 08:06:34,583 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:06:34,583 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:06:34,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:06:34,652 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;@2368bc43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:06:34,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:06:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 08:06:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 08:06:34,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:06:34,675 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:06:34,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:06:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:06:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-20 08:06:34,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:06:34,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710117878] [2024-11-20 08:06:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:34,702 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-20 08:06:34,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:06:34,706 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-20 08:06:34,708 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-20 08:06:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:34,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 08:06:34,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:06:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 406 proven. 78 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-20 08:06:36,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:06:40,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:06:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710117878] [2024-11-20 08:06:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710117878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:06:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676130577] [2024-11-20 08:06:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:06:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 08:06:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 08:06:40,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 08:06:40,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-20 08:06:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:06:40,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 08:06:40,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:06:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 388 proven. 72 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-20 08:06:48,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:06:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [676130577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:06:57,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:06:57,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-20 08:06:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195003751] [2024-11-20 08:06:57,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:06:57,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 08:06:57,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:06:57,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 08:06:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=650, Unknown=1, NotChecked=0, Total=756 [2024-11-20 08:06:57,087 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 22 states, 22 states have (on average 3.772727272727273) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (31), 7 states have call predecessors, (31), 12 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32)