./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.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 c98f11b22cb7f21f16458350f1cbd6d1f011c1c4c927275150c8a07b39dcf245 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:25:04,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:25:04,362 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:25:04,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:25:04,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:25:04,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:25:04,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:25:04,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:25:04,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:25:04,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:25:04,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:25:04,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:25:04,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:25:04,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:25:04,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:25:04,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:25:04,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:25:04,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:25:04,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:25:04,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:25:04,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:25:04,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:25:04,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:25:04,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:25:04,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:25:04,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:25:04,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:25:04,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:25:04,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:25:04,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:25:04,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:25:04,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:25:04,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:04,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:25:04,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:25:04,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:25:04,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:25:04,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:25:04,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:25:04,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:25:04,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:25:04,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:25:04,426 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 -> c98f11b22cb7f21f16458350f1cbd6d1f011c1c4c927275150c8a07b39dcf245 [2024-11-08 19:25:04,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:25:04,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:25:04,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:25:04,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:25:04,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:25:04,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:06,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:25:06,522 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:25:06,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:06,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4edb02252/1915d1c48cfc43419017c5c9b41d2053/FLAGbba4251e6 [2024-11-08 19:25:06,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4edb02252/1915d1c48cfc43419017c5c9b41d2053 [2024-11-08 19:25:06,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:25:06,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:25:06,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:06,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:25:06,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:25:06,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42811719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06, skipping insertion in model container [2024-11-08 19:25:06,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:25:06,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i[918,931] [2024-11-08 19:25:06,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:06,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:25:06,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i[918,931] [2024-11-08 19:25:06,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:06,898 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:25:06,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06 WrapperNode [2024-11-08 19:25:06,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:06,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:06,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:25:06,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:25:06,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,945 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-08 19:25:06,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:06,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:25:06,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:25:06,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:25:06,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:25:06,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:06,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:25:06,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:25:06,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:25:06,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:25:06,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (1/1) ... [2024-11-08 19:25:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:07,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:25:07,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:25:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:25:07,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:25:07,084 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:25:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:25:07,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:25:07,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:25:07,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:25:07,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:25:07,500 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:25:07,501 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:25:07,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:25:07,520 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:25:07,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:07 BoogieIcfgContainer [2024-11-08 19:25:07,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:25:07,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:25:07,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:25:07,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:25:07,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:25:06" (1/3) ... [2024-11-08 19:25:07,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2269b241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:07, skipping insertion in model container [2024-11-08 19:25:07,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:06" (2/3) ... [2024-11-08 19:25:07,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2269b241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:07, skipping insertion in model container [2024-11-08 19:25:07,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:07" (3/3) ... [2024-11-08 19:25:07,533 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:07,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:25:07,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:25:07,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:25:07,638 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;@57dba82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:25:07,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:25:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:25:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:25:07,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:07,658 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:07,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:07,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash -101837091, now seen corresponding path program 1 times [2024-11-08 19:25:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264839272] [2024-11-08 19:25:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:25:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:25:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:25:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:25:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:25:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:25:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:25:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:25:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:25:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:25:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:25:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:25:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:08,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264839272] [2024-11-08 19:25:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264839272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:25:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648502601] [2024-11-08 19:25:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:08,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:25:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:25:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:08,095 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:08,121 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2024-11-08 19:25:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:25:08,124 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-08 19:25:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:08,148 INFO L225 Difference]: With dead ends: 97 [2024-11-08 19:25:08,151 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 19:25:08,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:08,161 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:08,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:25:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 19:25:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 19:25:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:25:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-08 19:25:08,214 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 90 [2024-11-08 19:25:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-08 19:25:08,215 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-08 19:25:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:25:08,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:08,218 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:08,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:25:08,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:08,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:08,220 INFO L85 PathProgramCache]: Analyzing trace with hash 266380255, now seen corresponding path program 1 times [2024-11-08 19:25:08,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707632519] [2024-11-08 19:25:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:25:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:25:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:25:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:25:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:25:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:25:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:25:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:25:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:25:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:25:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:25:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:25:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707632519] [2024-11-08 19:25:08,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707632519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:25:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593802132] [2024-11-08 19:25:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:25:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:08,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:25:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:25:08,753 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:08,943 INFO L93 Difference]: Finished difference Result 139 states and 199 transitions. [2024-11-08 19:25:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:25:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-08 19:25:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:08,948 INFO L225 Difference]: With dead ends: 139 [2024-11-08 19:25:08,948 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 19:25:08,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-11-08 19:25:08,951 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:08,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 188 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:25:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 19:25:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-08 19:25:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:25:08,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-11-08 19:25:08,978 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 90 [2024-11-08 19:25:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:08,979 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-11-08 19:25:08,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-11-08 19:25:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:25:08,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:08,985 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:08,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:25:08,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:08,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1507089997, now seen corresponding path program 1 times [2024-11-08 19:25:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245001633] [2024-11-08 19:25:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:25:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:25:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:25:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:25:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:25:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:25:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:25:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:25:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:25:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:25:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:25:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:25:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245001633] [2024-11-08 19:25:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245001633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:09,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:09,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:25:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465971517] [2024-11-08 19:25:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:09,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:25:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:09,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:25:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:25:09,340 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:09,563 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2024-11-08 19:25:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:25:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-08 19:25:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:09,568 INFO L225 Difference]: With dead ends: 200 [2024-11-08 19:25:09,569 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 19:25:09,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-11-08 19:25:09,573 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 74 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:09,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:25:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 19:25:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2024-11-08 19:25:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 99 states have internal predecessors, (118), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 19:25:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2024-11-08 19:25:09,610 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 91 [2024-11-08 19:25:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 210 transitions. [2024-11-08 19:25:09,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-08 19:25:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:25:09,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:09,613 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:09,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:25:09,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:09,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:09,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1012869937, now seen corresponding path program 1 times [2024-11-08 19:25:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663653450] [2024-11-08 19:25:09,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:09,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:25:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:25:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:25:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 19:25:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 19:25:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:25:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:25:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 19:25:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:25:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:25:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 19:25:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:25:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 19:25:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663653450] [2024-11-08 19:25:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663653450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:25:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94509065] [2024-11-08 19:25:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:10,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:10,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:10,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:25:10,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:25:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:10,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 19:25:10,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-08 19:25:10,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:25:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94509065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:25:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-08 19:25:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069733985] [2024-11-08 19:25:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:10,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:25:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:10,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:25:10,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:25:10,313 INFO L87 Difference]: Start difference. First operand 150 states and 210 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:10,786 INFO L93 Difference]: Finished difference Result 418 states and 566 transitions. [2024-11-08 19:25:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 19:25:10,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-08 19:25:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:10,791 INFO L225 Difference]: With dead ends: 418 [2024-11-08 19:25:10,792 INFO L226 Difference]: Without dead ends: 304 [2024-11-08 19:25:10,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:25:10,794 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:10,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 342 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:25:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-08 19:25:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-11-08 19:25:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 204 states have (on average 1.1813725490196079) internal successors, (241), 206 states have internal predecessors, (241), 79 states have call successors, (79), 18 states have call predecessors, (79), 18 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-08 19:25:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2024-11-08 19:25:10,836 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 91 [2024-11-08 19:25:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:10,836 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2024-11-08 19:25:10,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2024-11-08 19:25:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:25:10,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:10,842 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:10,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:25:11,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:11,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1713934515, now seen corresponding path program 1 times [2024-11-08 19:25:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459645671] [2024-11-08 19:25:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:25:11,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75571971] [2024-11-08 19:25:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:11,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:11,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:25:11,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:25:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:11,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:25:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:11,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:25:11,281 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:25:11,282 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:25:11,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:25:11,485 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-11-08 19:25:11,489 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 19:25:11,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:25:11,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:25:11 BoogieIcfgContainer [2024-11-08 19:25:11,580 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:25:11,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:25:11,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:25:11,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:25:11,581 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:07" (3/4) ... [2024-11-08 19:25:11,584 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:25:11,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:25:11,586 INFO L158 Benchmark]: Toolchain (without parser) took 5034.72ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 114.5MB in the beginning and 90.0MB in the end (delta: 24.5MB). Peak memory consumption was 76.8MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,586 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:25:11,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.79ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 99.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.63ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,587 INFO L158 Benchmark]: Boogie Preprocessor took 50.53ms. Allocated memory is still 169.9MB. Free memory was 97.2MB in the beginning and 94.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,587 INFO L158 Benchmark]: RCFGBuilder took 522.33ms. Allocated memory is still 169.9MB. Free memory was 94.4MB in the beginning and 78.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,587 INFO L158 Benchmark]: TraceAbstraction took 4055.44ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 77.6MB in the beginning and 90.0MB in the end (delta: -12.4MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:11,588 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 220.2MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:25:11,589 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.20ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.79ms. Allocated memory is still 169.9MB. Free memory was 114.0MB in the beginning and 99.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.63ms. Allocated memory is still 169.9MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.53ms. Allocated memory is still 169.9MB. Free memory was 97.2MB in the beginning and 94.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.33ms. Allocated memory is still 169.9MB. Free memory was 94.4MB in the beginning and 78.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4055.44ms. Allocated memory was 169.9MB in the beginning and 220.2MB in the end (delta: 50.3MB). Free memory was 77.6MB in the beginning and 90.0MB in the end (delta: -12.4MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 220.2MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryArithmeticFLOAToperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L106] last_1_var_1_1 = var_1_1 [L107] last_1_var_1_8 = var_1_8 [L108] last_1_var_1_12 = var_1_12 [L109] last_1_var_1_16 = var_1_16 [L110] last_1_var_1_17 = var_1_17 [L111] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L82] var_1_5 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L83] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L84] var_1_6 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L85] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] var_1_7 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L87] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L88] var_1_9 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L89] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L90] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L90] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L91] var_1_10 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_11 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_14 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] var_1_15 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] var_1_18 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L122] RET updateVariables() [L123] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] COND TRUE ((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11) [L62] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=2, var_1_9=536870911] [L64] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L65] COND TRUE var_1_16 < var_1_11 [L66] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L70] COND FALSE !(\read(var_1_19)) [L77] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L79] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L123] RET step() [L124] CALL, EXPR property() [L114-L115] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 742 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 274 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=4, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 448 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 1 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1557/1560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:25:11,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.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 c98f11b22cb7f21f16458350f1cbd6d1f011c1c4c927275150c8a07b39dcf245 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:25:13,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:25:14,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:25:14,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:25:14,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:25:14,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:25:14,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:25:14,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:25:14,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:25:14,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:25:14,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:25:14,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:25:14,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:25:14,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:25:14,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:25:14,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:25:14,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:25:14,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:25:14,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:25:14,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:25:14,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:25:14,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:25:14,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:25:14,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:25:14,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:25:14,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:25:14,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:25:14,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:25:14,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:25:14,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:25:14,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:25:14,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:25:14,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:25:14,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:25:14,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:14,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:25:14,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:25:14,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:25:14,065 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:25:14,065 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:25:14,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:25:14,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:25:14,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:25:14,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:25:14,066 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 -> c98f11b22cb7f21f16458350f1cbd6d1f011c1c4c927275150c8a07b39dcf245 [2024-11-08 19:25:14,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:25:14,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:25:14,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:25:14,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:25:14,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:25:14,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:15,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:25:16,214 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:25:16,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:16,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247425009/b2ff132b153446ebb5b8635c51ab110b/FLAG4ff16145c [2024-11-08 19:25:16,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247425009/b2ff132b153446ebb5b8635c51ab110b [2024-11-08 19:25:16,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:25:16,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:25:16,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:16,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:25:16,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:25:16,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794d783d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16, skipping insertion in model container [2024-11-08 19:25:16,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:25:16,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i[918,931] [2024-11-08 19:25:16,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:16,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:25:16,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-6.i[918,931] [2024-11-08 19:25:16,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:16,592 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:25:16,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16 WrapperNode [2024-11-08 19:25:16,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:16,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:16,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:25:16,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:25:16,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,639 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-08 19:25:16,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:16,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:25:16,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:25:16,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:25:16,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:25:16,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:25:16,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:25:16,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:25:16,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:25:16,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (1/1) ... [2024-11-08 19:25:16,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:16,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:16,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:25:16,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:25:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:25:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:25:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:25:16,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:25:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:25:16,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:25:16,869 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:25:16,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:25:40,491 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:25:40,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:25:40,507 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:25:40,507 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:25:40,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:40 BoogieIcfgContainer [2024-11-08 19:25:40,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:25:40,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:25:40,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:25:40,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:25:40,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:25:16" (1/3) ... [2024-11-08 19:25:40,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60052ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:40, skipping insertion in model container [2024-11-08 19:25:40,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:16" (2/3) ... [2024-11-08 19:25:40,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60052ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:40, skipping insertion in model container [2024-11-08 19:25:40,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:40" (3/3) ... [2024-11-08 19:25:40,517 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-6.i [2024-11-08 19:25:40,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:25:40,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:25:40,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:25:40,612 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;@1b158156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:25:40,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:25:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:25:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:25:40,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:40,631 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:40,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:40,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash -101837091, now seen corresponding path program 1 times [2024-11-08 19:25:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:25:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352356077] [2024-11-08 19:25:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:40,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:25:40,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:25:40,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:25:40,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:25:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:41,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:25:41,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-08 19:25:41,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:25:41,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:25:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352356077] [2024-11-08 19:25:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352356077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:41,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:25:41,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760497045] [2024-11-08 19:25:41,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:25:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:25:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:25:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:41,641 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:41,662 INFO L93 Difference]: Finished difference Result 97 states and 159 transitions. [2024-11-08 19:25:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:25:41,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-08 19:25:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:41,670 INFO L225 Difference]: With dead ends: 97 [2024-11-08 19:25:41,670 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 19:25:41,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:41,676 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:41,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:25:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 19:25:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 19:25:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-08 19:25:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-11-08 19:25:41,715 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 90 [2024-11-08 19:25:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:41,716 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-11-08 19:25:41,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 19:25:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-11-08 19:25:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 19:25:41,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:41,720 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:41,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:25:41,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:25:41,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 266380255, now seen corresponding path program 1 times [2024-11-08 19:25:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:25:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097923941] [2024-11-08 19:25:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:25:41,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:25:41,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:25:41,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:25:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:42,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:25:42,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 19:25:44,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:25:44,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:25:44,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097923941] [2024-11-08 19:25:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097923941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:44,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:25:44,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103484326] [2024-11-08 19:25:44,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:25:44,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:25:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:25:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:25:44,912 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:25:49,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:25:53,527 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-11-08 19:25:57,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:26:01,974 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-11-08 19:26:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:26:01,975 INFO L93 Difference]: Finished difference Result 139 states and 199 transitions. [2024-11-08 19:26:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:26:02,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-08 19:26:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:26:02,080 INFO L225 Difference]: With dead ends: 139 [2024-11-08 19:26:02,080 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 19:26:02,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-11-08 19:26:02,082 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 57 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:26:02,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 189 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-08 19:26:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 19:26:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-08 19:26:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:26:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-11-08 19:26:02,102 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 90 [2024-11-08 19:26:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:26:02,103 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-11-08 19:26:02,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-08 19:26:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-11-08 19:26:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 19:26:02,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:26:02,105 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:26:02,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:26:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:26:02,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:26:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:26:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1507089997, now seen corresponding path program 1 times [2024-11-08 19:26:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:26:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320450929] [2024-11-08 19:26:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:26:02,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:26:02,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:26:02,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:26:02,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:26:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:03,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 19:26:03,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:26:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 166 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-08 19:26:07,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:26:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 19:26:09,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:26:09,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320450929] [2024-11-08 19:26:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320450929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:26:09,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:26:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-08 19:26:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700513276] [2024-11-08 19:26:09,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:26:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:26:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:26:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:26:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:26:09,876 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-08 19:26:14,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:26:19,923 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-11-08 19:26:23,932 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-11-08 19:26:27,946 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-11-08 19:26:32,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:26:36,387 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 []