./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:10:38,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:10:38,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:10:38,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:10:38,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:10:38,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:10:38,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:10:38,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:10:38,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:10:38,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:10:38,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:10:38,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:10:38,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:10:38,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:10:38,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:10:38,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:10:38,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:10:38,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:10:38,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:10:38,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:10:38,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:10:38,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:10:38,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:10:38,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:10:38,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:10:38,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:10:38,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:10:38,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:10:38,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:10:38,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:10:38,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:10:38,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:10:38,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:10:38,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:10:38,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:10:38,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:10:38,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:10:38,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:10:38,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:10:38,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:10:38,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:10:38,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:10:38,360 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2024-11-10 08:10:38,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:10:38,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:10:38,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:10:38,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:10:38,662 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:10:38,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-10 08:10:40,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:10:40,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:10:40,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-10 08:10:40,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc87bd746/de349f6604e948c2bb8106414ff06feb/FLAGd7a59d7a8 [2024-11-10 08:10:40,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc87bd746/de349f6604e948c2bb8106414ff06feb [2024-11-10 08:10:40,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:10:40,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:10:40,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:10:40,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:10:40,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:10:40,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:10:40" (1/1) ... [2024-11-10 08:10:40,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b139bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:40, skipping insertion in model container [2024-11-10 08:10:40,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:10:40" (1/1) ... [2024-11-10 08:10:40,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:10:41,043 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_amount100_file-61.i[916,929] [2024-11-10 08:10:41,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:10:41,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:10:41,180 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_amount100_file-61.i[916,929] [2024-11-10 08:10:41,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:10:41,251 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:10:41,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41 WrapperNode [2024-11-10 08:10:41,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:10:41,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:10:41,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:10:41,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:10:41,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,323 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-10 08:10:41,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:10:41,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:10:41,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:10:41,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:10:41,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,394 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-10 08:10:41,394 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,394 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:10:41,457 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:10:41,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:10:41,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:10:41,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (1/1) ... [2024-11-10 08:10:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:10:41,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:10:41,496 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-10 08:10:41,500 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-10 08:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:10:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:10:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:10:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:10:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:10:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:10:41,653 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:10:41,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:10:42,321 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2024-11-10 08:10:42,377 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-10 08:10:42,378 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:10:42,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:10:42,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:10:42,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:10:42 BoogieIcfgContainer [2024-11-10 08:10:42,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:10:42,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:10:42,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:10:42,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:10:42,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:10:40" (1/3) ... [2024-11-10 08:10:42,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:10:42, skipping insertion in model container [2024-11-10 08:10:42,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:10:41" (2/3) ... [2024-11-10 08:10:42,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4c4116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:10:42, skipping insertion in model container [2024-11-10 08:10:42,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:10:42" (3/3) ... [2024-11-10 08:10:42,420 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2024-11-10 08:10:42,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:10:42,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:10:42,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:10:42,523 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;@5e9cfcdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:10:42,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:10:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:10:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 08:10:42,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:42,542 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:42,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:42,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash 708793512, now seen corresponding path program 1 times [2024-11-10 08:10:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:42,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823465019] [2024-11-10 08:10:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:42,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823465019] [2024-11-10 08:10:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823465019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:43,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:10:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626989012] [2024-11-10 08:10:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:43,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:10:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:10:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:10:43,257 INFO L87 Difference]: Start difference. First operand has 109 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 08:10:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:43,314 INFO L93 Difference]: Finished difference Result 210 states and 357 transitions. [2024-11-10 08:10:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:10:43,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-11-10 08:10:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:43,326 INFO L225 Difference]: With dead ends: 210 [2024-11-10 08:10:43,326 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 08:10:43,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:10:43,335 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:43,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:10:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 08:10:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 08:10:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:10:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2024-11-10 08:10:43,405 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 177 [2024-11-10 08:10:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2024-11-10 08:10:43,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 08:10:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2024-11-10 08:10:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 08:10:43,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:43,413 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:10:43,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:43,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1083232564, now seen corresponding path program 1 times [2024-11-10 08:10:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312243630] [2024-11-10 08:10:43,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:43,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312243630] [2024-11-10 08:10:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312243630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:10:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238547256] [2024-11-10 08:10:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:44,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:10:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:10:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:10:44,292 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:44,431 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-10 08:10:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:10:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 08:10:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:44,438 INFO L225 Difference]: With dead ends: 209 [2024-11-10 08:10:44,438 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 08:10:44,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:10:44,443 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 96 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:44,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:10:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 08:10:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 08:10:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:10:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2024-11-10 08:10:44,465 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 177 [2024-11-10 08:10:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:44,467 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 163 transitions. [2024-11-10 08:10:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 163 transitions. [2024-11-10 08:10:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 08:10:44,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:44,471 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:10:44,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1858425035, now seen corresponding path program 1 times [2024-11-10 08:10:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598212607] [2024-11-10 08:10:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:47,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:47,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598212607] [2024-11-10 08:10:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598212607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:47,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:10:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564364679] [2024-11-10 08:10:47,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:47,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:10:47,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:10:47,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:10:47,633 INFO L87 Difference]: Start difference. First operand 108 states and 163 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:50,002 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2024-11-10 08:10:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:10:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 08:10:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:50,006 INFO L225 Difference]: With dead ends: 472 [2024-11-10 08:10:50,006 INFO L226 Difference]: Without dead ends: 367 [2024-11-10 08:10:50,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:10:50,009 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 858 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:50,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 669 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 08:10:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-10 08:10:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 205. [2024-11-10 08:10:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:10:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2024-11-10 08:10:50,064 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 177 [2024-11-10 08:10:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:50,066 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2024-11-10 08:10:50,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2024-11-10 08:10:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 08:10:50,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:50,073 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:50,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:10:50,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1933645649, now seen corresponding path program 1 times [2024-11-10 08:10:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130509840] [2024-11-10 08:10:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130509840] [2024-11-10 08:10:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130509840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:10:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767272784] [2024-11-10 08:10:52,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:10:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:10:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:52,280 INFO L87 Difference]: Start difference. First operand 205 states and 315 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:52,762 INFO L93 Difference]: Finished difference Result 392 states and 593 transitions. [2024-11-10 08:10:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:10:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 08:10:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:52,770 INFO L225 Difference]: With dead ends: 392 [2024-11-10 08:10:52,770 INFO L226 Difference]: Without dead ends: 287 [2024-11-10 08:10:52,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:10:52,774 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 151 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:52,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 501 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:10:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-10 08:10:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 223. [2024-11-10 08:10:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 166 states have (on average 1.4397590361445782) internal successors, (239), 166 states have internal predecessors, (239), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:10:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2024-11-10 08:10:52,822 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 178 [2024-11-10 08:10:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2024-11-10 08:10:52,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2024-11-10 08:10:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 08:10:52,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:52,829 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:52,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:10:52,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:52,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1292168775, now seen corresponding path program 1 times [2024-11-10 08:10:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:52,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882423495] [2024-11-10 08:10:52,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:52,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:53,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:53,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882423495] [2024-11-10 08:10:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882423495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:53,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:53,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:10:53,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143328150] [2024-11-10 08:10:53,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:10:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:53,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:10:53,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:53,566 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:54,340 INFO L93 Difference]: Finished difference Result 723 states and 1109 transitions. [2024-11-10 08:10:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:10:54,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 08:10:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:54,345 INFO L225 Difference]: With dead ends: 723 [2024-11-10 08:10:54,345 INFO L226 Difference]: Without dead ends: 579 [2024-11-10 08:10:54,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:10:54,349 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 249 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:54,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 754 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 08:10:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-10 08:10:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 521. [2024-11-10 08:10:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 436 states have (on average 1.5022935779816513) internal successors, (655), 436 states have internal predecessors, (655), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:10:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-10 08:10:54,409 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-10 08:10:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-10 08:10:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-10 08:10:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 08:10:54,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:54,413 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:10:54,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash -863937951, now seen corresponding path program 1 times [2024-11-10 08:10:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230071340] [2024-11-10 08:10:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:55,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:55,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230071340] [2024-11-10 08:10:55,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230071340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:55,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:55,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:10:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005475643] [2024-11-10 08:10:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:55,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:10:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:55,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:10:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:10:55,997 INFO L87 Difference]: Start difference. First operand 521 states and 811 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:56,413 INFO L93 Difference]: Finished difference Result 992 states and 1537 transitions. [2024-11-10 08:10:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:10:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 08:10:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:56,421 INFO L225 Difference]: With dead ends: 992 [2024-11-10 08:10:56,421 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 08:10:56,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:56,425 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 98 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:56,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 510 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:10:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 08:10:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 521. [2024-11-10 08:10:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 436 states have (on average 1.5022935779816513) internal successors, (655), 436 states have internal predecessors, (655), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:10:56,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-10 08:10:56,473 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-10 08:10:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:56,474 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-10 08:10:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-10 08:10:56,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 08:10:56,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:56,478 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:56,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:10:56,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -349669668, now seen corresponding path program 1 times [2024-11-10 08:10:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844901952] [2024-11-10 08:10:56,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844901952] [2024-11-10 08:10:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844901952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:10:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767720306] [2024-11-10 08:10:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:57,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:10:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:57,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:10:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:57,663 INFO L87 Difference]: Start difference. First operand 521 states and 811 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:58,081 INFO L93 Difference]: Finished difference Result 1057 states and 1611 transitions. [2024-11-10 08:10:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:10:58,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-11-10 08:10:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:58,087 INFO L225 Difference]: With dead ends: 1057 [2024-11-10 08:10:58,087 INFO L226 Difference]: Without dead ends: 700 [2024-11-10 08:10:58,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:10:58,089 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 135 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:58,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 524 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:10:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-10 08:10:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 493. [2024-11-10 08:10:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 408 states have (on average 1.4509803921568627) internal successors, (592), 408 states have internal predecessors, (592), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:10:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 748 transitions. [2024-11-10 08:10:58,129 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 748 transitions. Word has length 179 [2024-11-10 08:10:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:58,130 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 748 transitions. [2024-11-10 08:10:58,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 748 transitions. [2024-11-10 08:10:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 08:10:58,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:58,132 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:58,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:10:58,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash -501087181, now seen corresponding path program 1 times [2024-11-10 08:10:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49628700] [2024-11-10 08:10:58,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:58,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:10:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:58,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49628700] [2024-11-10 08:10:58,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49628700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:10:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:10:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:10:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381113622] [2024-11-10 08:10:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:10:58,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:10:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:10:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:10:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:58,525 INFO L87 Difference]: Start difference. First operand 493 states and 748 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:58,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:10:58,705 INFO L93 Difference]: Finished difference Result 863 states and 1312 transitions. [2024-11-10 08:10:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:10:58,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-10 08:10:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:10:58,709 INFO L225 Difference]: With dead ends: 863 [2024-11-10 08:10:58,709 INFO L226 Difference]: Without dead ends: 486 [2024-11-10 08:10:58,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:10:58,710 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:10:58,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:10:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-10 08:10:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-10 08:10:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 401 states have (on average 1.428927680798005) internal successors, (573), 401 states have internal predecessors, (573), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:10:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 729 transitions. [2024-11-10 08:10:58,741 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 729 transitions. Word has length 180 [2024-11-10 08:10:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:10:58,742 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 729 transitions. [2024-11-10 08:10:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:10:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 729 transitions. [2024-11-10 08:10:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 08:10:58,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:10:58,744 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:10:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:10:58,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:10:58,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:10:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -959422466, now seen corresponding path program 1 times [2024-11-10 08:10:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:10:58,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127555768] [2024-11-10 08:10:58,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:10:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:10:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:10:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:10:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:10:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:10:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:10:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:10:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:10:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:10:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:10:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:10:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:10:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:10:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:10:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:10:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:10:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:10:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:10:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:10:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:10:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:10:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:10:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:10:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:10:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:10:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:10:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 08:10:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:10:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127555768] [2024-11-10 08:10:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127555768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:10:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399916787] [2024-11-10 08:10:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:10:59,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:10:59,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:10:59,181 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-10 08:10:59,182 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-10 08:10:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:10:59,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:10:59,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:10:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 08:10:59,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 08:11:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399916787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:00,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:00,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-10 08:11:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545297261] [2024-11-10 08:11:00,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:00,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:11:00,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:11:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:11:00,042 INFO L87 Difference]: Start difference. First operand 486 states and 729 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-10 08:11:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:00,276 INFO L93 Difference]: Finished difference Result 848 states and 1254 transitions. [2024-11-10 08:11:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:11:00,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 182 [2024-11-10 08:11:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:00,281 INFO L225 Difference]: With dead ends: 848 [2024-11-10 08:11:00,281 INFO L226 Difference]: Without dead ends: 468 [2024-11-10 08:11:00,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:11:00,282 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:00,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 283 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:11:00,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-10 08:11:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 456. [2024-11-10 08:11:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 368 states have (on average 1.3831521739130435) internal successors, (509), 368 states have internal predecessors, (509), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:11:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 665 transitions. [2024-11-10 08:11:00,318 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 665 transitions. Word has length 182 [2024-11-10 08:11:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 665 transitions. [2024-11-10 08:11:00,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-10 08:11:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 665 transitions. [2024-11-10 08:11:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 08:11:00,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:00,321 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:00,342 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-10 08:11:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:00,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:00,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash 823696142, now seen corresponding path program 1 times [2024-11-10 08:11:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:00,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807299806] [2024-11-10 08:11:00,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:11:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:11:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:11:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:11:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:11:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:11:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:11:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:11:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:11:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:11:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:11:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:11:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:11:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:11:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:11:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:11:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807299806] [2024-11-10 08:11:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807299806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:00,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:00,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:11:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675355235] [2024-11-10 08:11:00,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:00,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:11:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:00,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:11:00,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:11:00,702 INFO L87 Difference]: Start difference. First operand 456 states and 665 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:11:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:00,794 INFO L93 Difference]: Finished difference Result 979 states and 1427 transitions. [2024-11-10 08:11:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:11:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-11-10 08:11:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:00,798 INFO L225 Difference]: With dead ends: 979 [2024-11-10 08:11:00,799 INFO L226 Difference]: Without dead ends: 653 [2024-11-10 08:11:00,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10 08:11:00,801 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 50 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:00,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:11:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-10 08:11:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 604. [2024-11-10 08:11:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.4186046511627908) internal successors, (732), 516 states have internal predecessors, (732), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:11:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 888 transitions. [2024-11-10 08:11:00,843 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 888 transitions. Word has length 182 [2024-11-10 08:11:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:00,843 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 888 transitions. [2024-11-10 08:11:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:11:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 888 transitions. [2024-11-10 08:11:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 08:11:00,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:00,847 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:11:00,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:00,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1038031961, now seen corresponding path program 1 times [2024-11-10 08:11:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624266581] [2024-11-10 08:11:00,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:11:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:11:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:11:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:11:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:11:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:11:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:11:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:11:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:11:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:11:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:11:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:11:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:11:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:11:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:11:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 08:11:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624266581] [2024-11-10 08:11:01,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624266581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:01,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:01,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:11:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198903489] [2024-11-10 08:11:01,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:01,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:11:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:11:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:11:01,206 INFO L87 Difference]: Start difference. First operand 604 states and 888 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:11:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:01,433 INFO L93 Difference]: Finished difference Result 1044 states and 1524 transitions. [2024-11-10 08:11:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:11:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-11-10 08:11:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:01,439 INFO L225 Difference]: With dead ends: 1044 [2024-11-10 08:11:01,439 INFO L226 Difference]: Without dead ends: 769 [2024-11-10 08:11:01,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:11:01,441 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 258 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:01,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 513 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:11:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-10 08:11:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 604. [2024-11-10 08:11:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.4166666666666667) internal successors, (731), 516 states have internal predecessors, (731), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:11:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 887 transitions. [2024-11-10 08:11:01,480 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 887 transitions. Word has length 182 [2024-11-10 08:11:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:01,481 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 887 transitions. [2024-11-10 08:11:01,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 08:11:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 887 transitions. [2024-11-10 08:11:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 08:11:01,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:01,484 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:01,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 08:11:01,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:01,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1948549355, now seen corresponding path program 1 times [2024-11-10 08:11:01,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:01,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120666776] [2024-11-10 08:11:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:11:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:11:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:11:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:11:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:11:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:11:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:11:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:11:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:11:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:11:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:11:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:11:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:11:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:11:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 08:11:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:11:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 08:11:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:11:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:01,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 08:11:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 08:11:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 08:11:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 08:11:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:11:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 08:11:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 08:11:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 08:11:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 08:11:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120666776] [2024-11-10 08:11:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120666776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689566804] [2024-11-10 08:11:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:02,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:02,036 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-10 08:11:02,038 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-10 08:11:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:02,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 08:11:02,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 08:11:02,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 08:11:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689566804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:03,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:11:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-10 08:11:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446635183] [2024-11-10 08:11:03,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:11:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:11:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:11:03,225 INFO L87 Difference]: Start difference. First operand 604 states and 887 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-10 08:11:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:04,525 INFO L93 Difference]: Finished difference Result 1479 states and 2087 transitions. [2024-11-10 08:11:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 08:11:04,526 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 183 [2024-11-10 08:11:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:04,531 INFO L225 Difference]: With dead ends: 1479 [2024-11-10 08:11:04,531 INFO L226 Difference]: Without dead ends: 880 [2024-11-10 08:11:04,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 08:11:04,533 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 514 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:04,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 687 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 08:11:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-10 08:11:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 552. [2024-11-10 08:11:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 461 states have (on average 1.3253796095444685) internal successors, (611), 461 states have internal predecessors, (611), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 08:11:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 767 transitions. [2024-11-10 08:11:04,577 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 767 transitions. Word has length 183 [2024-11-10 08:11:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:04,577 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 767 transitions. [2024-11-10 08:11:04,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-10 08:11:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 767 transitions. [2024-11-10 08:11:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 08:11:04,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:04,581 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:11:04,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 08:11:04,781 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,SelfDestructingSolverStorable11 [2024-11-10 08:11:04,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:04,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2061593691, now seen corresponding path program 1 times [2024-11-10 08:11:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860871987] [2024-11-10 08:11:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:11:04,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654475751] [2024-11-10 08:11:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:04,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:04,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 08:11:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:05,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 08:11:05,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 338 proven. 12 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-10 08:11:05,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:11:35,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860871987] [2024-11-10 08:11:35,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 08:11:35,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654475751] [2024-11-10 08:11:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654475751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:11:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 08:11:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121757905] [2024-11-10 08:11:35,136 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:35,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 08:11:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:11:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 08:11:35,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=295, Unknown=7, NotChecked=0, Total=420 [2024-11-10 08:11:35,138 INFO L87 Difference]: Start difference. First operand 552 states and 767 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 08:11:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:38,309 INFO L93 Difference]: Finished difference Result 2054 states and 2777 transitions. [2024-11-10 08:11:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 08:11:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 184 [2024-11-10 08:11:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:38,321 INFO L225 Difference]: With dead ends: 2054 [2024-11-10 08:11:38,321 INFO L226 Difference]: Without dead ends: 1865 [2024-11-10 08:11:38,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=480, Invalid=1073, Unknown=7, NotChecked=0, Total=1560 [2024-11-10 08:11:38,324 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 473 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:38,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1147 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 08:11:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-10 08:11:38,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1314. [2024-11-10 08:11:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1131 states have (on average 1.3359858532272326) internal successors, (1511), 1132 states have internal predecessors, (1511), 152 states have call successors, (152), 30 states have call predecessors, (152), 30 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-10 08:11:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1815 transitions. [2024-11-10 08:11:38,416 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1815 transitions. Word has length 184 [2024-11-10 08:11:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:38,417 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1815 transitions. [2024-11-10 08:11:38,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 08:11:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1815 transitions. [2024-11-10 08:11:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 08:11:38,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:38,419 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:11:38,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 08:11:38,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:38,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:38,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1144758924, now seen corresponding path program 1 times [2024-11-10 08:11:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:11:38,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245691930] [2024-11-10 08:11:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:38,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:11:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:11:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338546188] [2024-11-10 08:11:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:38,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:38,793 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:11:38,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 08:11:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:11:39,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:11:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:11:39,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:11:39,242 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:11:39,243 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:11:39,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 08:11:39,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:11:39,449 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:39,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:11:39,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:11:39 BoogieIcfgContainer [2024-11-10 08:11:39,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:11:39,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:11:39,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:11:39,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:11:39,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:10:42" (3/4) ... [2024-11-10 08:11:39,585 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:11:39,586 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:11:39,587 INFO L158 Benchmark]: Toolchain (without parser) took 58880.13ms. Allocated memory was 180.4MB in the beginning and 490.7MB in the end (delta: 310.4MB). Free memory was 115.6MB in the beginning and 415.8MB in the end (delta: -300.2MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2024-11-10 08:11:39,587 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:11:39,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.44ms. Allocated memory is still 180.4MB. Free memory was 115.6MB in the beginning and 144.0MB in the end (delta: -28.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:11:39,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.59ms. Allocated memory is still 180.4MB. Free memory was 144.0MB in the beginning and 137.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:11:39,589 INFO L158 Benchmark]: Boogie Preprocessor took 132.11ms. Allocated memory is still 180.4MB. Free memory was 137.7MB in the beginning and 127.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 08:11:39,589 INFO L158 Benchmark]: IcfgBuilder took 949.80ms. Allocated memory is still 180.4MB. Free memory was 127.2MB in the beginning and 88.4MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 08:11:39,589 INFO L158 Benchmark]: TraceAbstraction took 57172.78ms. Allocated memory was 180.4MB in the beginning and 490.7MB in the end (delta: 310.4MB). Free memory was 87.4MB in the beginning and 416.8MB in the end (delta: -329.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:11:39,590 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 490.7MB. Free memory was 416.8MB in the beginning and 415.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:11:39,591 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 46.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.44ms. Allocated memory is still 180.4MB. Free memory was 115.6MB in the beginning and 144.0MB in the end (delta: -28.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.59ms. Allocated memory is still 180.4MB. Free memory was 144.0MB in the beginning and 137.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.11ms. Allocated memory is still 180.4MB. Free memory was 137.7MB in the beginning and 127.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 949.80ms. Allocated memory is still 180.4MB. Free memory was 127.2MB in the beginning and 88.4MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57172.78ms. Allocated memory was 180.4MB in the beginning and 490.7MB in the end (delta: 310.4MB). Free memory was 87.4MB in the beginning and 416.8MB in the end (delta: -329.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 490.7MB. Free memory was 416.8MB in the beginning and 415.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of shiftRight at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 3511246143; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 5; [L28] unsigned long int var_1_8 = 2220610682; [L29] unsigned long int var_1_9 = 3786407275; [L30] unsigned char var_1_12 = 64; [L31] unsigned long int var_1_13 = 100; [L32] signed long int var_1_14 = 1; [L33] unsigned long int var_1_15 = 3489174775; [L34] signed char var_1_16 = 1; [L35] signed char var_1_17 = -16; [L36] signed short int var_1_18 = 0; [L37] signed short int var_1_19 = 64; [L38] signed short int var_1_20 = 2; [L39] double var_1_21 = 7.5; [L40] double var_1_22 = 99.5; [L41] signed short int var_1_23 = 500; [L42] unsigned short int var_1_24 = 5; [L43] double var_1_25 = 127.5; [L44] unsigned short int var_1_26 = 33797; [L45] unsigned short int var_1_28 = 27913; [L46] signed long int var_1_30 = 2; [L47] unsigned char last_1_var_1_7 = 5; [L48] signed short int last_1_var_1_18 = 0; [L49] unsigned short int last_1_var_1_24 = 5; [L50] signed long int last_1_var_1_30 = 2; VAL [isInitial=0, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=3511246143, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L191] last_1_var_1_7 = var_1_7 [L192] last_1_var_1_18 = var_1_18 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=3511246143, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_2 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L150] RET assume_abort_if_not(var_1_2 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L151] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L151] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L152] var_1_5 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L153] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L154] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L154] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L155] var_1_6 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L156] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L157] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L157] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L158] var_1_8 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L159] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L160] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L160] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L161] var_1_9 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L162] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L163] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L163] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L164] var_1_12 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L165] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L166] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L166] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L167] var_1_14 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L168] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L169] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L169] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L170] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L170] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L171] var_1_15 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_15 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L172] RET assume_abort_if_not(var_1_15 >= 3221225470) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L173] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L173] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L174] var_1_17 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L175] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L176] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L176] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L178] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L180] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L181] var_1_25 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L182] RET assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L183] var_1_26 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L184] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L185] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L185] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L186] var_1_28 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L187] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L188] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L188] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L205] RET updateVariables() [L206] CALL step() [L54] unsigned long int stepLocal_5 = var_1_9; [L55] unsigned long int stepLocal_4 = (((0u) < (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))) ? (0u) : (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))); VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_5=-2147483649, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L56] COND FALSE !(last_1_var_1_30 >= stepLocal_5) [L67] var_1_23 = var_1_12 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L69] signed long int stepLocal_6 = -1; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L70] COND TRUE var_1_22 <= ((((var_1_21) < (var_1_25)) ? (var_1_21) : (var_1_25))) [L71] var_1_24 = (((((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) > (last_1_var_1_7)) ? ((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) : (last_1_var_1_7))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L77] EXPR last_1_var_1_7 >> var_1_2 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L77] COND TRUE (last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24)))) [L78] var_1_7 = var_1_12 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L82] COND FALSE !(((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) >= (- 9.5)) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L85] var_1_1 = (var_1_2 - 8u) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L86] EXPR var_1_12 ^ var_1_7 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L86] signed long int stepLocal_1 = var_1_12 ^ var_1_7; [L87] signed long int stepLocal_0 = var_1_24 % var_1_14; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_0=0, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L88] COND FALSE !(stepLocal_0 > 16u) [L93] var_1_13 = ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L95] COND TRUE var_1_12 >= var_1_7 [L96] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L98] unsigned char stepLocal_9 = var_1_6; [L99] unsigned short int stepLocal_8 = var_1_24; [L100] signed char stepLocal_7 = var_1_16; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_7=1, stepLocal_8=32767, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L101] COND TRUE (last_1_var_1_30 / var_1_26) != stepLocal_8 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_7=1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L102] COND TRUE var_1_23 <= stepLocal_7 [L103] var_1_30 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L116] COND FALSE !(((- var_1_2) + var_1_7) != var_1_24) [L123] var_1_3 = var_1_6 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L125] unsigned long int stepLocal_2 = var_1_2; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_2=-32767, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L126] COND TRUE var_1_8 > stepLocal_2 [L127] var_1_18 = (((((-32) > (var_1_12)) ? (-32) : (var_1_12))) + ((((var_1_20) < (last_1_var_1_18)) ? (var_1_20) : (last_1_var_1_18)))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L135] unsigned char stepLocal_3 = var_1_12; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_3=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L136] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_3=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L139] COND TRUE stepLocal_3 < 100 [L140] var_1_19 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR ((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR last_1_var_1_7 >> var_1_2 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR ((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR (((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR ((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR (((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197-L198] return ((((((((((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))))))) && ((var_1_12 >= var_1_7) ? (var_1_16 == ((signed char) var_1_17)) : 1)) && ((var_1_8 > var_1_2) ? (var_1_18 == ((signed short int) (((((-32) > (var_1_12)) ? (-32) : (var_1_12))) + ((((var_1_20) < (last_1_var_1_18)) ? (var_1_20) : (last_1_var_1_18)))))) : (var_1_3 ? (var_1_18 == ((signed short int) var_1_12)) : (var_1_18 == ((signed short int) var_1_20))))) && (var_1_3 ? (var_1_19 == ((signed short int) var_1_17)) : ((var_1_12 < 100) ? (var_1_19 == ((signed short int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_5 ? (var_1_19 == ((signed short int) var_1_13)) : 1)))) && ((((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) >= (- 9.5)) ? (var_1_20 == ((signed short int) var_1_7)) : 1)) && ((last_1_var_1_30 >= var_1_9) ? (((last_1_var_1_30 / var_1_8) > ((((0u) < (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))) ? (0u) : (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))))) ? (var_1_6 ? (var_1_23 == ((signed short int) var_1_12)) : (var_1_23 == ((signed short int) last_1_var_1_24))) : (var_1_23 == ((signed short int) var_1_17))) : (var_1_23 == ((signed short int) var_1_12)))) && ((var_1_22 <= ((((var_1_21) < (var_1_25)) ? (var_1_21) : (var_1_25)))) ? (var_1_24 == ((unsigned short int) (((((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) > (last_1_var_1_7)) ? ((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) : (last_1_var_1_7))))) : (((last_1_var_1_24 + (last_1_var_1_18 / 16)) < -1) ? (var_1_24 == ((unsigned short int) (((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (last_1_var_1_24)) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (last_1_var_1_24))) + (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - (last_1_var_1_7 + 2))))) : 1))) && (((last_1_var_1_30 / var_1_26) != var_1_24) ? ((var_1_23 <= var_1_16) ? (var_1_30 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) : (((var_1_25 != (- 50.7)) && var_1_6) ? (var_1_6 ? (var_1_30 == ((signed long int) var_1_15)) : 1) : (var_1_30 == ((signed long int) var_1_7)))) : (var_1_30 == ((signed long int) var_1_7))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.0s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3102 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3098 mSDsluCounter, 6617 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4601 mSDsCounter, 710 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3749 IncrementalHoareTripleChecker+Invalid, 4459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 710 mSolverCounterUnsat, 2016 mSDtfsCounter, 3749 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1629 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 32.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1314occurred in iteration=13, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1724 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 3256 NumberOfCodeBlocks, 3256 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3050 ConstructedInterpolants, 0 QuantifiedInterpolants, 10973 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 21668/22100 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-10 08:11:39,815 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 08:11:39,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:11:41,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:11:41,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:11:41,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:11:41,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:11:42,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:11:42,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:11:42,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:11:42,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:11:42,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:11:42,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:11:42,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:11:42,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:11:42,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:11:42,038 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:11:42,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:11:42,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:11:42,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:11:42,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:11:42,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:11:42,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:11:42,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:11:42,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:11:42,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:11:42,045 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:11:42,045 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:11:42,045 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:11:42,046 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:11:42,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:11:42,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:11:42,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:11:42,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:11:42,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:11:42,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:11:42,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:11:42,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:11:42,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:11:42,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:11:42,048 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:11:42,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:11:42,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:11:42,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:11:42,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:11:42,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:11:42,050 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2024-11-10 08:11:42,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:11:42,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:11:42,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:11:42,423 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:11:42,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:11:42,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-10 08:11:44,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:11:44,441 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:11:44,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-10 08:11:44,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8edd20d5/10931dfa7bf9439eb4f177c97b649b79/FLAG24d85b7f8 [2024-11-10 08:11:44,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8edd20d5/10931dfa7bf9439eb4f177c97b649b79 [2024-11-10 08:11:44,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:11:44,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:11:44,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:11:44,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:11:44,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:11:44,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:11:44" (1/1) ... [2024-11-10 08:11:44,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bd1ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:44, skipping insertion in model container [2024-11-10 08:11:44,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:11:44" (1/1) ... [2024-11-10 08:11:44,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:11:45,003 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_amount100_file-61.i[916,929] [2024-11-10 08:11:45,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:11:45,146 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:11:45,159 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_amount100_file-61.i[916,929] [2024-11-10 08:11:45,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:11:45,225 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:11:45,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45 WrapperNode [2024-11-10 08:11:45,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:11:45,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:11:45,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:11:45,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:11:45,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,298 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-10 08:11:45,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:11:45,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:11:45,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:11:45,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:11:45,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,348 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-10 08:11:45,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:11:45,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:11:45,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:11:45,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:11:45,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (1/1) ... [2024-11-10 08:11:45,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:11:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:11:45,408 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-10 08:11:45,411 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-10 08:11:45,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:11:45,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:11:45,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:11:45,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:11:45,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:11:45,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:11:45,561 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:11:45,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:11:46,410 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 08:11:46,412 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:11:46,427 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:11:46,428 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:11:46,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:11:46 BoogieIcfgContainer [2024-11-10 08:11:46,429 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:11:46,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:11:46,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:11:46,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:11:46,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:11:44" (1/3) ... [2024-11-10 08:11:46,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f19fdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:11:46, skipping insertion in model container [2024-11-10 08:11:46,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:11:45" (2/3) ... [2024-11-10 08:11:46,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f19fdb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:11:46, skipping insertion in model container [2024-11-10 08:11:46,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:11:46" (3/3) ... [2024-11-10 08:11:46,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2024-11-10 08:11:46,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:11:46,454 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:11:46,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:11:46,529 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;@75f3dc25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:11:46,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:11:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:11:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 08:11:46,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:46,552 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:46,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1029183383, now seen corresponding path program 1 times [2024-11-10 08:11:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:11:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462797900] [2024-11-10 08:11:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:46,577 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-10 08:11:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:11:46,582 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-10 08:11:46,584 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-10 08:11:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:46,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:11:46,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-10 08:11:47,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:11:47,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:11:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462797900] [2024-11-10 08:11:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462797900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:11:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:11:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:11:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368606520] [2024-11-10 08:11:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:11:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:11:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:11:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:11:47,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:11:47,093 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 08:11:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:47,120 INFO L93 Difference]: Finished difference Result 168 states and 293 transitions. [2024-11-10 08:11:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:11:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-10 08:11:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:47,128 INFO L225 Difference]: With dead ends: 168 [2024-11-10 08:11:47,128 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 08:11:47,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:11:47,134 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:47,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:11:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 08:11:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 08:11:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:11:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-11-10 08:11:47,180 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 170 [2024-11-10 08:11:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:47,181 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-11-10 08:11:47,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 08:11:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-11-10 08:11:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 08:11:47,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:47,185 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:47,197 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 08:11:47,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:11:47,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1550949875, now seen corresponding path program 1 times [2024-11-10 08:11:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:11:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891179645] [2024-11-10 08:11:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:47,389 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-10 08:11:47,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:11:47,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:11:47,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 08:11:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:47,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 08:11:47,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 08:11:48,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 08:11:48,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:11:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891179645] [2024-11-10 08:11:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891179645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:11:48,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:11:48,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 08:11:48,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664087253] [2024-11-10 08:11:48,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:11:48,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:11:48,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:11:48,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:11:48,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:11:48,636 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 08:11:49,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:11:49,568 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2024-11-10 08:11:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 08:11:49,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 170 [2024-11-10 08:11:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:11:49,572 INFO L225 Difference]: With dead ends: 257 [2024-11-10 08:11:49,573 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 08:11:49,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 08:11:49,575 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 08:11:49,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 307 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 08:11:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 08:11:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 92. [2024-11-10 08:11:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:11:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-10 08:11:49,611 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 170 [2024-11-10 08:11:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:11:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-10 08:11:49,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 08:11:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-10 08:11:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 08:11:49,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:11:49,622 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:11:49,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:11:49,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:11:49,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:11:49,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:11:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522903, now seen corresponding path program 1 times [2024-11-10 08:11:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:11:49,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287064409] [2024-11-10 08:11:49,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:49,826 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-10 08:11:49,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:11:49,827 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10 08:11:49,829 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 (4)] Waiting until timeout for monitored process [2024-11-10 08:11:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:50,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 08:11:50,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:11:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 584 proven. 105 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-10 08:11:51,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:11:51,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:11:51,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287064409] [2024-11-10 08:11:51,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287064409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:11:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1593249453] [2024-11-10 08:11:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:11:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 08:11:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 08:11:51,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 08:11:51,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 08:11:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:11:52,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 08:11:52,483 INFO L278 TraceCheckSpWp]: Computing forward predicates...