./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-57.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-57.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 00ca84abae40dfb9f755f19284e3f94b13402b7689f1ab8afdf6fe1633b787fb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:24:58,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:58,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:24:59,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:59,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:24:59,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:59,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:24:59,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:24:59,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:24:59,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:24:59,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:59,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:24:59,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:59,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:59,032 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:24:59,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:59,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:59,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:59,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:24:59,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:59,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:59,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:59,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:59,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:59,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:59,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:59,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:59,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:59,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:59,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:24:59,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:24:59,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:24:59,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:59,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:59,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:59,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:59,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:24:59,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:24:59,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:24:59,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:24:59,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:24:59,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:24:59,045 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 -> 00ca84abae40dfb9f755f19284e3f94b13402b7689f1ab8afdf6fe1633b787fb [2024-11-08 19:24:59,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:59,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:59,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:59,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:59,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:59,380 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-57.i [2024-11-08 19:25:00,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:25:01,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:25:01,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-57.i [2024-11-08 19:25:01,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1fbb8b0/f72be0992135495391e83184b71d242b/FLAG8b86de3e9 [2024-11-08 19:25:01,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1fbb8b0/f72be0992135495391e83184b71d242b [2024-11-08 19:25:01,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:25:01,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:25:01,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:01,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:25:01,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:25:01,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:01" (1/1) ... [2024-11-08 19:25:01,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ea2c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:01, skipping insertion in model container [2024-11-08 19:25:01,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:01" (1/1) ... [2024-11-08 19:25:01,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:25:01,635 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-57.i[919,932] [2024-11-08 19:25:01,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:01,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:25:01,741 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-57.i[919,932] [2024-11-08 19:25:01,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:01,813 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:25:01,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:01 WrapperNode [2024-11-08 19:25:01,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:01,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:01,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:25:01,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:25:01,824 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:01" (1/1) ... [2024-11-08 19:25:01,838 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:01" (1/1) ... [2024-11-08 19:25:01,886 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-08 19:25:01,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:01,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:25:01,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:25:01,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:25:01,901 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:01" (1/1) ... [2024-11-08 19:25:01,902 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:01" (1/1) ... [2024-11-08 19:25:01,909 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:01" (1/1) ... [2024-11-08 19:25:01,939 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:01,940 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:01" (1/1) ... [2024-11-08 19:25:01,940 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:01" (1/1) ... [2024-11-08 19:25:01,958 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:01" (1/1) ... [2024-11-08 19:25:01,963 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:01" (1/1) ... [2024-11-08 19:25:01,971 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:01" (1/1) ... [2024-11-08 19:25:01,977 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:01" (1/1) ... [2024-11-08 19:25:01,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:25:01,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:25:01,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:25:01,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:25:01,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:01" (1/1) ... [2024-11-08 19:25:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:02,035 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:02,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:25:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:25:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:25:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:25:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:25:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:25:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:25:02,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:25:02,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:25:02,645 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 19:25:02,645 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:25:02,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:25:02,665 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:25:02,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:02 BoogieIcfgContainer [2024-11-08 19:25:02,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:25:02,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:25:02,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:25:02,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:25:02,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:25:01" (1/3) ... [2024-11-08 19:25:02,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29515945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:02, skipping insertion in model container [2024-11-08 19:25:02,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:01" (2/3) ... [2024-11-08 19:25:02,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29515945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:02, skipping insertion in model container [2024-11-08 19:25:02,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:02" (3/3) ... [2024-11-08 19:25:02,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-57.i [2024-11-08 19:25:02,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:25:02,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:25:02,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:25:02,771 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;@1a4bb623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:25:02,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:25:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:25:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:25:02,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:02,794 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:02,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 188167197, now seen corresponding path program 1 times [2024-11-08 19:25:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11644718] [2024-11-08 19:25:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:02,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:25:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:25:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:25:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:25:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:25:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:25:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:25:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:25:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:25:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:25:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:25:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:25:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:25:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:25:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:25:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:25:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:25:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:25:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:25:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:25:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:25:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:25:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:25:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:25:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:25:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:25:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:03,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11644718] [2024-11-08 19:25:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11644718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:25:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620466201] [2024-11-08 19:25:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:03,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:25:03,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:25:03,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:03,322 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:03,366 INFO L93 Difference]: Finished difference Result 169 states and 292 transitions. [2024-11-08 19:25:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:25:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-08 19:25:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:03,379 INFO L225 Difference]: With dead ends: 169 [2024-11-08 19:25:03,379 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 19:25:03,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:03,388 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:03,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:25:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 19:25:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-08 19:25:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:25:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-08 19:25:03,448 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 166 [2024-11-08 19:25:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:03,450 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-08 19:25:03,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-08 19:25:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:25:03,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:03,458 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:03,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:25:03,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 592388949, now seen corresponding path program 1 times [2024-11-08 19:25:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278590303] [2024-11-08 19:25:03,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:03,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:25:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:25:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:25:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:25:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:25:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:25:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:25:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:25:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:25:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:25:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:25:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:25:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:25:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:25:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:25:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:25:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:25:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:25:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:25:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:25:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:25:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:25:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:25:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:25:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:25:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 19:25:04,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278590303] [2024-11-08 19:25:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278590303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:25:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706741682] [2024-11-08 19:25:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:04,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:04,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:04,270 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:04,274 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:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 19:25:04,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 213 proven. 69 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-08 19:25:04,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:25:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-08 19:25:05,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706741682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:25:05,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:25:05,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 19:25:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124998451] [2024-11-08 19:25:05,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:25:05,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:25:05,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:25:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:25:05,085 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:25:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:05,425 INFO L93 Difference]: Finished difference Result 172 states and 262 transitions. [2024-11-08 19:25:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:25:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 166 [2024-11-08 19:25:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:05,431 INFO L225 Difference]: With dead ends: 172 [2024-11-08 19:25:05,431 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 19:25:05,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:25:05,433 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 58 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:05,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 302 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:25:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 19:25:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-08 19:25:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 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:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2024-11-08 19:25:05,447 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 166 [2024-11-08 19:25:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:05,448 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2024-11-08 19:25:05,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 19:25:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-11-08 19:25:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:25:05,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:05,451 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:05,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:25:05,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:05,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:05,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash 850554387, now seen corresponding path program 1 times [2024-11-08 19:25:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260274910] [2024-11-08 19:25:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:25:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:25:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:25:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:25:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:25:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:25:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 19:25:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:25:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 19:25:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:25:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:25:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:25:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:25:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:25:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:25:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:25:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:25:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:25:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:25:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:25:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:25:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:25:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:25:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:25:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:25:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:25:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 19:25:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:25:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260274910] [2024-11-08 19:25:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260274910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:06,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:25:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244981431] [2024-11-08 19:25:06,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:06,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:25:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:25:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:25:06,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:25:06,261 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:07,165 INFO L93 Difference]: Finished difference Result 416 states and 615 transitions. [2024-11-08 19:25:07,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:25:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-11-08 19:25:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:07,173 INFO L225 Difference]: With dead ends: 416 [2024-11-08 19:25:07,173 INFO L226 Difference]: Without dead ends: 330 [2024-11-08 19:25:07,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:25:07,176 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 509 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:25:07,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 516 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 19:25:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-08 19:25:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 299. [2024-11-08 19:25:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 210 states have (on average 1.3714285714285714) internal successors, (288), 212 states have internal predecessors, (288), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-08 19:25:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 448 transitions. [2024-11-08 19:25:07,242 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 448 transitions. Word has length 166 [2024-11-08 19:25:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:07,243 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 448 transitions. [2024-11-08 19:25:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 448 transitions. [2024-11-08 19:25:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 19:25:07,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:07,250 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:25:07,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1661286806, now seen corresponding path program 1 times [2024-11-08 19:25:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:25:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808687334] [2024-11-08 19:25:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:25:07,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078940182] [2024-11-08 19:25:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:25:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:07,340 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:07,342 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:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:07,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:25:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:25:07,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:25:07,634 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:25:07,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:25:07,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:25:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 19:25:07,842 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:25:07,978 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:25:07,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:25:07 BoogieIcfgContainer [2024-11-08 19:25:07,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:25:07,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:25:07,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:25:07,985 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:25:07,986 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:02" (3/4) ... [2024-11-08 19:25:07,989 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:25:07,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:25:07,991 INFO L158 Benchmark]: Toolchain (without parser) took 6572.97ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 138.3MB in the beginning and 84.2MB in the end (delta: 54.2MB). Peak memory consumption was 95.1MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,992 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:25:07,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.48ms. Allocated memory is still 174.1MB. Free memory was 137.3MB in the beginning and 121.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.56ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,993 INFO L158 Benchmark]: Boogie Preprocessor took 101.13ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 112.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,993 INFO L158 Benchmark]: RCFGBuilder took 676.70ms. Allocated memory is still 174.1MB. Free memory was 112.1MB in the beginning and 121.0MB in the end (delta: -8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,994 INFO L158 Benchmark]: TraceAbstraction took 5315.87ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 121.0MB in the beginning and 84.2MB in the end (delta: 36.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2024-11-08 19:25:07,995 INFO L158 Benchmark]: Witness Printer took 5.62ms. Allocated memory is still 216.0MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:25:07,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.48ms. Allocated memory is still 174.1MB. Free memory was 137.3MB in the beginning and 121.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.56ms. Allocated memory is still 174.1MB. Free memory was 121.5MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.13ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 112.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 676.70ms. Allocated memory is still 174.1MB. Free memory was 112.1MB in the beginning and 121.0MB in the end (delta: -8.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5315.87ms. Allocated memory was 174.1MB in the beginning and 216.0MB in the end (delta: 41.9MB). Free memory was 121.0MB in the beginning and 84.2MB in the end (delta: 36.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 5.62ms. Allocated memory is still 216.0MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=-1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L85] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L86] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L86] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=10, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L87] var_1_3 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L88] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L89] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L89] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L90] var_1_5 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L91] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L92] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L93] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L94] var_1_6 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L95] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L96] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L97] var_1_8 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L98] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L99] var_1_9 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L100] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L101] var_1_10 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L102] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L103] var_1_11 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L104] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L105] var_1_12 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L106] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L107] var_1_14 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L108] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L109] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L109] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L110] var_1_15 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L111] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L112] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L112] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L113] var_1_16 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L114] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L115] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L115] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L117] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L118] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L118] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L121] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L121] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L124] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L124] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_7=124/5] [L137] RET updateVariables() [L138] CALL step() [L46] COND TRUE -256 <= var_1_2 [L47] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L53] COND TRUE var_1_11 <= var_1_9 [L54] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L56] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L57] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L65] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L65] COND FALSE !(var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) [L68] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L68] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) [L75] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L77] COND TRUE var_1_1 > var_1_20 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1] [L78] COND TRUE ! (! var_1_6) [L79] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L129] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L129-L130] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=190, var_1_15=63, var_1_16=127, var_1_17=64, var_1_18=0, var_1_19=63, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_2=1, var_1_3=0, var_1_5=129, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 947 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 565 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 855 IncrementalHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 382 mSDtfsCounter, 855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 516 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6293/6500 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:08,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-57.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 00ca84abae40dfb9f755f19284e3f94b13402b7689f1ab8afdf6fe1633b787fb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:25:10,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:25:10,283 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:10,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:25:10,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:25:10,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:25:10,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:25:10,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:25:10,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:25:10,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:25:10,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:25:10,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:25:10,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:25:10,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:25:10,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:25:10,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:25:10,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:25:10,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:25:10,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:25:10,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:25:10,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:25:10,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:25:10,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:25:10,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:25:10,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:25:10,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:25:10,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:25:10,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:25:10,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:25:10,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:25:10,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:25:10,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:25:10,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:25:10,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:25:10,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:10,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:25:10,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:25:10,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:25:10,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:25:10,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:25:10,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:25:10,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:25:10,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:25:10,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:25:10,339 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 -> 00ca84abae40dfb9f755f19284e3f94b13402b7689f1ab8afdf6fe1633b787fb [2024-11-08 19:25:10,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:25:10,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:25:10,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:25:10,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:25:10,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:25:10,681 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-57.i [2024-11-08 19:25:12,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:25:12,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:25:12,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-57.i [2024-11-08 19:25:12,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5540b3752/3f0840212d23478f9f080cb2f88577cc/FLAGd950734c6 [2024-11-08 19:25:12,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5540b3752/3f0840212d23478f9f080cb2f88577cc [2024-11-08 19:25:12,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:25:12,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:25:12,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:12,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:25:12,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:25:12,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:12" (1/1) ... [2024-11-08 19:25:12,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e81f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:12, skipping insertion in model container [2024-11-08 19:25:12,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:25:12" (1/1) ... [2024-11-08 19:25:12,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:25:12,652 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-57.i[919,932] [2024-11-08 19:25:12,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:12,742 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:25:12,754 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-57.i[919,932] [2024-11-08 19:25:12,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:25:12,813 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:25:12,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:12 WrapperNode [2024-11-08 19:25:12,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:25:12,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:12,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:25:12,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:25:12,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:12" (1/1) ... [2024-11-08 19:25:12,840 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:12" (1/1) ... [2024-11-08 19:25:12,891 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-08 19:25:12,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:25:12,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:25:12,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:25:12,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:25:12,904 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:12" (1/1) ... [2024-11-08 19:25:12,904 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:12" (1/1) ... [2024-11-08 19:25:12,910 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:12" (1/1) ... [2024-11-08 19:25:12,926 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:12,928 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:12" (1/1) ... [2024-11-08 19:25:12,932 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:12" (1/1) ... [2024-11-08 19:25:12,944 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:12" (1/1) ... [2024-11-08 19:25:12,947 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:12" (1/1) ... [2024-11-08 19:25:12,952 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:12" (1/1) ... [2024-11-08 19:25:12,956 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:12" (1/1) ... [2024-11-08 19:25:12,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:25:12,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:25:12,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:25:12,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:25:12,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:12" (1/1) ... [2024-11-08 19:25:12,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:25:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:25:12,998 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:13,005 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:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:25:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:25:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:25:13,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:25:13,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:25:13,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:25:13,127 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:25:13,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:25:20,844 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:25:20,845 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:25:20,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:25:20,860 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:25:20,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:20 BoogieIcfgContainer [2024-11-08 19:25:20,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:25:20,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:25:20,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:25:20,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:25:20,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:25:12" (1/3) ... [2024-11-08 19:25:20,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180e9e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:20, skipping insertion in model container [2024-11-08 19:25:20,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:25:12" (2/3) ... [2024-11-08 19:25:20,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180e9e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:25:20, skipping insertion in model container [2024-11-08 19:25:20,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:25:20" (3/3) ... [2024-11-08 19:25:20,869 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-57.i [2024-11-08 19:25:20,885 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:25:20,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:25:20,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:25:20,951 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;@37683c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:25:20,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:25:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:25:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:25:20,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:20,972 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:20,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:20,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -860878285, now seen corresponding path program 1 times [2024-11-08 19:25:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:25:20,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520752482] [2024-11-08 19:25:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:20,996 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:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:25:20,999 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:21,000 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:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:21,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:25:21,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2024-11-08 19:25:21,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:25:21,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:25:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520752482] [2024-11-08 19:25:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520752482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:25:21,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:25:21,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:25:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655287059] [2024-11-08 19:25:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:25:21,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:25:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:25:21,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:25:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:21,549 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:25:21,599 INFO L93 Difference]: Finished difference Result 132 states and 234 transitions. [2024-11-08 19:25:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:25:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-11-08 19:25:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:25:21,609 INFO L225 Difference]: With dead ends: 132 [2024-11-08 19:25:21,609 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 19:25:21,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:25:21,619 INFO L432 NwaCegarLoop]: 98 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, 98 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:21,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 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:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 19:25:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 19:25:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:25:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2024-11-08 19:25:21,682 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 160 [2024-11-08 19:25:21,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:25:21,683 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 98 transitions. [2024-11-08 19:25:21,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 19:25:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 98 transitions. [2024-11-08 19:25:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 19:25:21,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:25:21,690 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:25:21,710 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:21,890 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:21,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:25:21,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:25:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 341427051, now seen corresponding path program 1 times [2024-11-08 19:25:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:25:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851495213] [2024-11-08 19:25:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:25:21,893 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:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:25:21,897 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:21,898 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:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:22,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 19:25:22,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:26:19,620 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 19:26:27,754 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)