./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.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 d778a78ed5d8f64839ebc759981239a04212e711dc61301fd74be486fa462707 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:09:23,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:23,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:09:23,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:23,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:23,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:23,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:23,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:23,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:23,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:23,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:23,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:23,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:23,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:23,492 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:23,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:23,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:23,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:23,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:09:23,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:23,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:23,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:23,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:23,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:23,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:23,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:23,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:23,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:23,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:23,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:23,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:23,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:09:23,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:09:23,500 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:23,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:23,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:23,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:23,502 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 -> d778a78ed5d8f64839ebc759981239a04212e711dc61301fd74be486fa462707 [2024-10-24 05:09:23,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:23,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:23,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:23,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:23,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:23,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:25,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:25,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:25,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:25,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e443e89e8/6d3707096aaf4d14ba71b441bad5eaae/FLAG1fe78332e [2024-10-24 05:09:25,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e443e89e8/6d3707096aaf4d14ba71b441bad5eaae [2024-10-24 05:09:25,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:25,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:25,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:25,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:25,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:25,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7a038e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25, skipping insertion in model container [2024-10-24 05:09:25,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:25,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2024-10-24 05:09:25,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:25,381 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:25,390 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2024-10-24 05:09:25,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:25,425 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:25,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25 WrapperNode [2024-10-24 05:09:25,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:25,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:25,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:25,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:25,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,461 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-24 05:09:25,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:25,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:25,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:25,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:25,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,492 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-10-24 05:09:25,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:25,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:25,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:25,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:25,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (1/1) ... [2024-10-24 05:09:25,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:25,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:25,542 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-10-24 05:09:25,544 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-10-24 05:09:25,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:25,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:09:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:25,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:25,660 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:25,662 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:25,919 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:25,919 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:25,955 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:25,955 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:25,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:25 BoogieIcfgContainer [2024-10-24 05:09:25,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:25,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:25,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:25,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:25,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:25" (1/3) ... [2024-10-24 05:09:25,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758fa09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:25, skipping insertion in model container [2024-10-24 05:09:25,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:25" (2/3) ... [2024-10-24 05:09:25,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758fa09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:25, skipping insertion in model container [2024-10-24 05:09:25,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:25" (3/3) ... [2024-10-24 05:09:25,963 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:25,975 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:25,975 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:26,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:26,024 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;@5877c417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:26,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:09:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:26,036 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:26,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1694795912, now seen corresponding path program 1 times [2024-10-24 05:09:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275928305] [2024-10-24 05:09:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 05:09:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 05:09:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:09:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 05:09:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:09:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:09:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:09:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:09:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:09:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:09:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:09:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:09:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:09:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:09:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:09:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:09:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:09:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:09:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275928305] [2024-10-24 05:09:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275928305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285345791] [2024-10-24 05:09:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:26,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:26,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:26,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:26,383 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:26,417 INFO L93 Difference]: Finished difference Result 113 states and 205 transitions. [2024-10-24 05:09:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-24 05:09:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:26,424 INFO L225 Difference]: With dead ends: 113 [2024-10-24 05:09:26,424 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 05:09:26,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-10-24 05:09:26,430 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:26,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:09:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 05:09:26,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 05:09:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2024-10-24 05:09:26,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 128 [2024-10-24 05:09:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2024-10-24 05:09:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2024-10-24 05:09:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:09:26,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:26,476 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:26,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:09:26,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -929478398, now seen corresponding path program 1 times [2024-10-24 05:09:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921081799] [2024-10-24 05:09:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 05:09:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 05:09:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:09:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 05:09:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:09:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:09:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:09:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:09:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:09:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:09:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:09:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:09:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:09:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:09:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:09:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:09:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:09:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:09:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:26,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:26,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921081799] [2024-10-24 05:09:26,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921081799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:26,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:26,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:09:26,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798804497] [2024-10-24 05:09:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:26,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:26,936 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:27,092 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-10-24 05:09:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:09:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-24 05:09:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:27,095 INFO L225 Difference]: With dead ends: 167 [2024-10-24 05:09:27,097 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 05:09:27,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:09:27,099 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 60 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:27,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 241 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:09:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 05:09:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2024-10-24 05:09:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 05:09:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-10-24 05:09:27,134 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 128 [2024-10-24 05:09:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-10-24 05:09:27,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-10-24 05:09:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:09:27,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:27,137 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:09:27,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1454725883, now seen corresponding path program 1 times [2024-10-24 05:09:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027004462] [2024-10-24 05:09:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 05:09:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 05:09:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:09:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 05:09:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:09:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:09:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:09:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:09:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:09:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:09:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:09:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:09:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:09:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:09:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:09:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:09:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:09:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:09:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027004462] [2024-10-24 05:09:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027004462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:09:27,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790539423] [2024-10-24 05:09:27,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:27,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:27,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:27,429 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:27,553 INFO L93 Difference]: Finished difference Result 211 states and 324 transitions. [2024-10-24 05:09:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:09:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2024-10-24 05:09:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:27,556 INFO L225 Difference]: With dead ends: 211 [2024-10-24 05:09:27,556 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 05:09:27,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:09:27,557 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:27,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:09:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 05:09:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2024-10-24 05:09:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 05:09:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2024-10-24 05:09:27,598 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 129 [2024-10-24 05:09:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:27,599 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2024-10-24 05:09:27,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:09:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2024-10-24 05:09:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 05:09:27,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:27,603 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:09:27,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1750276602, now seen corresponding path program 1 times [2024-10-24 05:09:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649527982] [2024-10-24 05:09:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 05:09:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 05:09:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:09:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 05:09:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:09:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:09:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:09:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:09:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:09:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:09:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:09:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:09:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:09:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:09:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:09:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:09:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:09:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:09:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:09:27,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649527982] [2024-10-24 05:09:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649527982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:09:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12796452] [2024-10-24 05:09:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:27,840 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-10-24 05:09:27,841 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-10-24 05:09:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:27,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:09:27,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-24 05:09:28,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:09:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:09:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12796452] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:09:28,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:09:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-24 05:09:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296220145] [2024-10-24 05:09:28,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:09:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:09:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:09:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:09:28,243 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-10-24 05:09:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:28,373 INFO L93 Difference]: Finished difference Result 274 states and 415 transitions. [2024-10-24 05:09:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 05:09:28,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 131 [2024-10-24 05:09:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:28,376 INFO L225 Difference]: With dead ends: 274 [2024-10-24 05:09:28,376 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 05:09:28,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-24 05:09:28,377 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:28,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 126 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:09:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 05:09:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-10-24 05:09:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 05:09:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 237 transitions. [2024-10-24 05:09:28,406 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 237 transitions. Word has length 131 [2024-10-24 05:09:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:28,408 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 237 transitions. [2024-10-24 05:09:28,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-10-24 05:09:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2024-10-24 05:09:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 05:09:28,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:28,409 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:28,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:09:28,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:28,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:28,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash 24730760, now seen corresponding path program 1 times [2024-10-24 05:09:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:28,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256320674] [2024-10-24 05:09:28,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:09:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 05:09:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 05:09:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 05:09:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 05:09:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 05:09:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 05:09:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 05:09:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 05:09:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 05:09:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 05:09:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 05:09:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 05:09:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:09:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 05:09:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 05:09:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 05:09:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 05:09:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 05:09:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 05:09:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 05:09:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:09:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:09:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256320674] [2024-10-24 05:09:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256320674] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:09:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545397026] [2024-10-24 05:09:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:28,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:28,915 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-10-24 05:09:28,916 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-10-24 05:09:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:29,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:09:29,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-24 05:09:29,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:09:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 05:09:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545397026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:09:29,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:09:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-24 05:09:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842197345] [2024-10-24 05:09:29,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:09:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:09:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:09:29,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:09:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:09:29,339 INFO L87 Difference]: Start difference. First operand 160 states and 237 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 05:09:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:29,696 INFO L93 Difference]: Finished difference Result 319 states and 456 transitions. [2024-10-24 05:09:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 05:09:29,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2024-10-24 05:09:29,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:29,699 INFO L225 Difference]: With dead ends: 319 [2024-10-24 05:09:29,699 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 05:09:29,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:09:29,700 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 179 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:29,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 276 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:09:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 05:09:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 174. [2024-10-24 05:09:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 101 states have (on average 1.188118811881188) internal successors, (120), 101 states have internal predecessors, (120), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 05:09:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2024-10-24 05:09:29,727 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 131 [2024-10-24 05:09:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2024-10-24 05:09:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 05:09:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2024-10-24 05:09:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 05:09:29,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:29,729 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:29,744 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-10-24 05:09:29,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:29,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:29,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:29,931 INFO L85 PathProgramCache]: Analyzing trace with hash 766245201, now seen corresponding path program 1 times [2024-10-24 05:09:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413457847] [2024-10-24 05:09:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:29,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:09:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:30,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:09:30,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:09:30,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:09:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:09:30,040 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 05:09:30,115 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:09:30,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:09:30 BoogieIcfgContainer [2024-10-24 05:09:30,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:09:30,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:09:30,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:09:30,120 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:09:30,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:25" (3/4) ... [2024-10-24 05:09:30,122 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:09:30,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:09:30,123 INFO L158 Benchmark]: Toolchain (without parser) took 4950.83ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 120.9MB in the beginning and 156.5MB in the end (delta: -35.7MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:30,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 104.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.11ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,124 INFO L158 Benchmark]: Boogie Preprocessor took 46.85ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 98.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,126 INFO L158 Benchmark]: RCFGBuilder took 443.20ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 136.1MB in the end (delta: -37.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,126 INFO L158 Benchmark]: TraceAbstraction took 4162.93ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 135.0MB in the beginning and 156.5MB in the end (delta: -21.6MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-10-24 05:09:30,126 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 262.1MB. Free memory is still 156.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:30,127 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.13ms. Allocated memory is still 176.2MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 104.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.11ms. Allocated memory is still 176.2MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.85ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 98.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 443.20ms. Allocated memory is still 176.2MB. Free memory was 98.8MB in the beginning and 136.1MB in the end (delta: -37.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4162.93ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 135.0MB in the beginning and 156.5MB in the end (delta: -21.6MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 262.1MB. Free memory is still 156.5MB. 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 136, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L130] last_1_var_1_1 = var_1_1 [L131] last_1_var_1_12 = var_1_12 [L132] last_1_var_1_17 = var_1_17 [L133] last_1_var_1_21 = var_1_21 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L97] var_1_5 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=5] [L102] var_1_9 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L103] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L104] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L104] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L105] var_1_10 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L106] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L107] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L107] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L108] var_1_11 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L110] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L110] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L111] var_1_13 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L112] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L113] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L113] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L114] var_1_15 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L115] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L116] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L116] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L117] var_1_18 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L118] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L119] var_1_22 = __VERIFIER_nondet_double() [L120] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L120] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L121] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L121] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L122] var_1_23 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L123] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L124] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L124] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L125] var_1_24 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L126] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L127] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L127] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L48] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L49] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L56] COND TRUE 32u >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L57] COND TRUE last_1_var_1_12 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L58] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L59] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L65] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-10, var_1_9=125] [L68] COND TRUE ! (var_1_17 > var_1_5) [L69] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] [L73] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L84] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] [L86] COND FALSE !(var_1_21 && var_1_21) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] [L89] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] [L145] RET step() [L146] CALL, EXPR property() [L136-L137] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=128, var_1_8=-1, var_1_9=125] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 344 mSDsluCounter, 979 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 564 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 472 IncrementalHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 415 mSDtfsCounter, 472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 788 GetRequests, 755 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 117 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2104 SizeOfPredicates, 5 NumberOfNonLiveVariables, 608 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 7434/7560 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-10-24 05:09:30,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.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 d778a78ed5d8f64839ebc759981239a04212e711dc61301fd74be486fa462707 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:09:31,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:32,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:09:32,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:32,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:32,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:32,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:32,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:32,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:32,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:32,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:32,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:32,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:32,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:32,084 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:32,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:32,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:32,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:32,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:32,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:32,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:32,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:09:32,088 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:32,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:32,088 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:32,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:32,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:32,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:32,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:32,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:32,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:32,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:32,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:32,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:09:32,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:09:32,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:32,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:32,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:32,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:32,092 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:09:32,093 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 -> d778a78ed5d8f64839ebc759981239a04212e711dc61301fd74be486fa462707 [2024-10-24 05:09:32,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:32,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:32,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:32,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:32,388 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:32,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:33,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:33,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:33,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:33,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befe922c1/a955901c5ff8414a94bdf0e36993a88e/FLAG0b75939a3 [2024-10-24 05:09:34,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befe922c1/a955901c5ff8414a94bdf0e36993a88e [2024-10-24 05:09:34,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:34,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:34,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:34,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:34,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:34,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fdbbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34, skipping insertion in model container [2024-10-24 05:09:34,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:34,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2024-10-24 05:09:34,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:34,478 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:34,486 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2024-10-24 05:09:34,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:34,535 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34 WrapperNode [2024-10-24 05:09:34,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:34,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:34,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:34,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:34,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,581 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-24 05:09:34,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:34,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:34,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:34,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:34,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,619 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-10-24 05:09:34,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:34,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:34,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:34,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:34,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (1/1) ... [2024-10-24 05:09:34,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:34,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:34,697 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-10-24 05:09:34,699 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-10-24 05:09:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:09:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:34,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:34,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:34,822 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:34,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:47,320 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:47,320 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:47,348 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:47,349 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:47,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:47 BoogieIcfgContainer [2024-10-24 05:09:47,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:47,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:47,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:47,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:47,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:34" (1/3) ... [2024-10-24 05:09:47,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2e9d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:47, skipping insertion in model container [2024-10-24 05:09:47,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:34" (2/3) ... [2024-10-24 05:09:47,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2e9d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:47, skipping insertion in model container [2024-10-24 05:09:47,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:47" (3/3) ... [2024-10-24 05:09:47,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-51.i [2024-10-24 05:09:47,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:47,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:47,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:47,422 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;@690a3340, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:47,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:09:47,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:47,449 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:47,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1694795912, now seen corresponding path program 1 times [2024-10-24 05:09:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:47,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604656598] [2024-10-24 05:09:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:47,468 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-10-24 05:09:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:47,470 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-10-24 05:09:47,471 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-10-24 05:09:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:48,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:09:48,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-24 05:09:48,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:09:48,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:09:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604656598] [2024-10-24 05:09:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604656598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335448586] [2024-10-24 05:09:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:48,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:09:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:48,255 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:52,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:09:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:52,515 INFO L93 Difference]: Finished difference Result 113 states and 205 transitions. [2024-10-24 05:09:52,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-24 05:09:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:52,595 INFO L225 Difference]: With dead ends: 113 [2024-10-24 05:09:52,595 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 05:09:52,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-10-24 05:09:52,599 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:52,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 05:09:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 05:09:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 05:09:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 05:09:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2024-10-24 05:09:52,636 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 128 [2024-10-24 05:09:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:52,636 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2024-10-24 05:09:52,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:09:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2024-10-24 05:09:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 05:09:52,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:52,639 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:09:52,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:09:52,839 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-10-24 05:09:52,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -929478398, now seen corresponding path program 1 times [2024-10-24 05:09:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091598155] [2024-10-24 05:09:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:52,841 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-10-24 05:09:52,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:52,844 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-10-24 05:09:52,845 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-10-24 05:09:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:53,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:09:53,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:09:56,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:09:56,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:09:56,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091598155] [2024-10-24 05:09:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091598155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:09:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897935257] [2024-10-24 05:09:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:09:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:09:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:09:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:09:56,176 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:10:00,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:04,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:08,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:13,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:17,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:21,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:25,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:25,582 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-10-24 05:10:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:10:25,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-24 05:10:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:25,664 INFO L225 Difference]: With dead ends: 167 [2024-10-24 05:10:25,664 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 05:10:25,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:10:25,665 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 57 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 43 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:10:25,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 241 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 14 Invalid, 7 Unknown, 0 Unchecked, 29.3s Time] [2024-10-24 05:10:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 05:10:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2024-10-24 05:10:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 05:10:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2024-10-24 05:10:25,687 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 128 [2024-10-24 05:10:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:25,688 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2024-10-24 05:10:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:10:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2024-10-24 05:10:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 05:10:25,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:25,692 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:10:25,712 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 05:10:25,893 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-10-24 05:10:25,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1454725883, now seen corresponding path program 1 times [2024-10-24 05:10:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:10:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125287974] [2024-10-24 05:10:25,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:25,895 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-10-24 05:10:25,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:10:25,899 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-10-24 05:10:25,900 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-10-24 05:10:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:26,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:10:26,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:10:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 05:10:29,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:10:29,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:10:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125287974] [2024-10-24 05:10:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125287974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:10:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:10:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:10:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217746782] [2024-10-24 05:10:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:10:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:10:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:10:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:10:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:10:29,320 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:10:33,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:37,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:42,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:46,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:50,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:54,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:10:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:10:54,669 INFO L93 Difference]: Finished difference Result 211 states and 324 transitions. [2024-10-24 05:10:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:10:54,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2024-10-24 05:10:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:10:54,758 INFO L225 Difference]: With dead ends: 211 [2024-10-24 05:10:54,759 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 05:10:54,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:10:54,760 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 66 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:10:54,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 250 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 25.3s Time] [2024-10-24 05:10:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 05:10:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2024-10-24 05:10:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 05:10:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2024-10-24 05:10:54,786 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 129 [2024-10-24 05:10:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:10:54,787 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2024-10-24 05:10:54,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 05:10:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2024-10-24 05:10:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 05:10:54,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:10:54,789 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:10:54,808 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 05:10:54,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-24 05:10:54,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:10:54,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:10:54,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1750276602, now seen corresponding path program 1 times [2024-10-24 05:10:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:10:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131552104] [2024-10-24 05:10:54,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:54,991 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-10-24 05:10:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:10:54,994 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-24 05:10:54,994 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 (5)] Waiting until timeout for monitored process [2024-10-24 05:10:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:55,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 05:10:55,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:10:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-24 05:10:57,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:10:57,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:10:57,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131552104] [2024-10-24 05:10:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131552104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:10:57,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1231044372] [2024-10-24 05:10:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:10:57,857 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 05:10:57,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 05:10:57,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 05:10:57,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 05:10:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:10:59,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:10:59,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:11:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-10-24 05:11:01,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:11:01,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1231044372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:11:01,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:11:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-24 05:11:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428130970] [2024-10-24 05:11:01,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:11:01,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:11:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:11:01,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:11:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:11:01,265 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 05:11:07,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []