./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.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 8bd8cdb54252e3a41260d832748f2d7f7ae2fd523d0e88c7d7f11f40d448b7f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:39:05,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:39:05,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:39:05,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:39:05,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:39:05,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:39:05,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:39:05,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:39:05,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:39:05,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:39:05,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:39:05,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:39:05,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:39:05,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:39:05,741 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:39:05,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:39:05,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:39:05,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:39:05,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:39:05,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:39:05,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:39:05,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:39:05,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:39:05,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:39:05,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:39:05,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:39:05,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:39:05,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:39:05,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:39:05,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:39:05,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:39:05,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:39:05,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:39:05,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:39:05,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:39:05,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:39:05,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:39:05,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:39:05,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:39:05,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:39:05,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:39:05,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:39:05,752 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 -> 8bd8cdb54252e3a41260d832748f2d7f7ae2fd523d0e88c7d7f11f40d448b7f4 [2024-10-24 05:39:05,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:39:06,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:39:06,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:39:06,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:39:06,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:39:06,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:07,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:39:07,668 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:39:07,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:07,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9019a21/38a16e81013f4a5ab272721ff3cb0473/FLAG351185b63 [2024-10-24 05:39:07,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9019a21/38a16e81013f4a5ab272721ff3cb0473 [2024-10-24 05:39:07,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:39:07,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:39:07,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:39:07,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:39:07,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:39:07,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:39:07" (1/1) ... [2024-10-24 05:39:07,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56953bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:07, skipping insertion in model container [2024-10-24 05:39:07,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:39:07" (1/1) ... [2024-10-24 05:39:07,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:39:07,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i[913,926] [2024-10-24 05:39:07,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:39:07,988 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:39:08,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i[913,926] [2024-10-24 05:39:08,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:39:08,049 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:39:08,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08 WrapperNode [2024-10-24 05:39:08,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:39:08,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:39:08,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:39:08,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:39:08,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,101 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 05:39:08,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:39:08,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:39:08,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:39:08,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:39:08,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,137 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:39:08,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:39:08,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:39:08,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:39:08,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:39:08,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (1/1) ... [2024-10-24 05:39:08,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:39:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:39:08,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:39:08,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:39:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:39:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:39:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:39:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:39:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:39:08,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:39:08,341 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:39:08,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:39:08,606 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 05:39:08,607 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:39:08,684 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:39:08,684 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:39:08,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:39:08 BoogieIcfgContainer [2024-10-24 05:39:08,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:39:08,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:39:08,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:39:08,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:39:08,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:39:07" (1/3) ... [2024-10-24 05:39:08,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:39:08, skipping insertion in model container [2024-10-24 05:39:08,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:08" (2/3) ... [2024-10-24 05:39:08,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:39:08, skipping insertion in model container [2024-10-24 05:39:08,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:39:08" (3/3) ... [2024-10-24 05:39:08,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:08,717 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:39:08,717 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:39:08,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:39:08,802 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;@2e2365e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:39:08,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:39:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:39:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 05:39:08,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:08,820 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:08,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:08,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:08,828 INFO L85 PathProgramCache]: Analyzing trace with hash 990375764, now seen corresponding path program 1 times [2024-10-24 05:39:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:39:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096635799] [2024-10-24 05:39:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:39:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:39:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:39:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:39:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:39:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:39:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:39:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:39:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:39:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:39:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:39:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:39:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:39:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:39:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:39:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:39:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:39:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:39:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 05:39:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:39:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096635799] [2024-10-24 05:39:09,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096635799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:09,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:09,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:39:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255813174] [2024-10-24 05:39:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:09,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:39:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:39:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:39:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:39:09,274 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 05:39:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:09,313 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-24 05:39:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:39:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-10-24 05:39:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:09,328 INFO L225 Difference]: With dead ends: 99 [2024-10-24 05:39:09,328 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 05:39:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:39:09,336 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:09,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:39:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 05:39:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 05:39:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:39:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-24 05:39:09,388 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 106 [2024-10-24 05:39:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:09,389 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-24 05:39:09,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 05:39:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-24 05:39:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 05:39:09,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:09,409 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:09,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:39:09,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:09,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash -123222896, now seen corresponding path program 1 times [2024-10-24 05:39:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:39:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306779792] [2024-10-24 05:39:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:39:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:39:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:39:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:39:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:39:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:39:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:39:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:39:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:39:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:39:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:39:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:39:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:39:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:39:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:39:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:39:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:39:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:39:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 05:39:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:39:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306779792] [2024-10-24 05:39:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306779792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:39:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454167466] [2024-10-24 05:39:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:39:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:39:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:39:10,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:39:10,402 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:10,489 INFO L93 Difference]: Finished difference Result 107 states and 160 transitions. [2024-10-24 05:39:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:39:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 05:39:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:10,492 INFO L225 Difference]: With dead ends: 107 [2024-10-24 05:39:10,494 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 05:39:10,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:39:10,496 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:10,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 186 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:39:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 05:39:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-10-24 05:39:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:39:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2024-10-24 05:39:10,518 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 106 [2024-10-24 05:39:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:10,519 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2024-10-24 05:39:10,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2024-10-24 05:39:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 05:39:10,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:10,522 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:10,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:39:10,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -123163314, now seen corresponding path program 1 times [2024-10-24 05:39:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:39:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65189106] [2024-10-24 05:39:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:39:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:39:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:39:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:39:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:39:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:39:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:39:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:39:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:39:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:39:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:39:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:39:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:39:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:39:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:39:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:39:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:39:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:39:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 05:39:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:39:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65189106] [2024-10-24 05:39:10,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65189106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:10,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:39:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13016899] [2024-10-24 05:39:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:39:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:39:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:39:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:39:10,884 INFO L87 Difference]: Start difference. First operand 53 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:11,097 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2024-10-24 05:39:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:39:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 05:39:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:11,103 INFO L225 Difference]: With dead ends: 158 [2024-10-24 05:39:11,103 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 05:39:11,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:39:11,107 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:11,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 236 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:39:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 05:39:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-10-24 05:39:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:39:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 128 transitions. [2024-10-24 05:39:11,134 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 128 transitions. Word has length 106 [2024-10-24 05:39:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 128 transitions. [2024-10-24 05:39:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 128 transitions. [2024-10-24 05:39:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 05:39:11,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:11,138 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:11,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:39:11,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:11,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:11,139 INFO L85 PathProgramCache]: Analyzing trace with hash 797569644, now seen corresponding path program 1 times [2024-10-24 05:39:11,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:39:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184674289] [2024-10-24 05:39:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:39:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:39:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:39:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:39:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:39:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:39:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:39:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:39:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:39:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:39:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:39:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:39:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:39:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:39:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:39:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:39:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:39:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:39:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 05:39:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:39:11,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184674289] [2024-10-24 05:39:11,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184674289] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:39:11,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707674778] [2024-10-24 05:39:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:39:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:39:11,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:39:11,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:39:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:11,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 05:39:11,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:39:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-24 05:39:12,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:39:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 05:39:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707674778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:39:12,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 05:39:12,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-24 05:39:12,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630696485] [2024-10-24 05:39:12,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 05:39:12,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 05:39:12,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:39:12,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 05:39:12,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:39:12,302 INFO L87 Difference]: Start difference. First operand 85 states and 128 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 05:39:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:12,569 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2024-10-24 05:39:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 05:39:12,570 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 107 [2024-10-24 05:39:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:12,572 INFO L225 Difference]: With dead ends: 149 [2024-10-24 05:39:12,572 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 05:39:12,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2024-10-24 05:39:12,576 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 151 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:12,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 104 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:39:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 05:39:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-24 05:39:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:39:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-24 05:39:12,602 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 107 [2024-10-24 05:39:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-24 05:39:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 05:39:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-24 05:39:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 05:39:12,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:12,608 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:12,627 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-10-24 05:39:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:39:12,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:12,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1856579691, now seen corresponding path program 1 times [2024-10-24 05:39:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:39:12,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546004186] [2024-10-24 05:39:12,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:12,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:39:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:39:12,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:39:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:39:13,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:39:13,061 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:39:13,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:39:13,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:39:13,067 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 05:39:13,163 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:39:13,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:39:13 BoogieIcfgContainer [2024-10-24 05:39:13,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:39:13,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:39:13,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:39:13,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:39:13,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:39:08" (3/4) ... [2024-10-24 05:39:13,170 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:39:13,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:39:13,171 INFO L158 Benchmark]: Toolchain (without parser) took 5466.73ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 133.2MB in the beginning and 109.3MB in the end (delta: 23.9MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,171 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:39:13,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.03ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 118.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 184.5MB. Free memory was 118.1MB in the beginning and 115.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,172 INFO L158 Benchmark]: Boogie Preprocessor took 49.78ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,173 INFO L158 Benchmark]: RCFGBuilder took 532.18ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 90.8MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,173 INFO L158 Benchmark]: TraceAbstraction took 4479.18ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 90.0MB in the beginning and 109.3MB in the end (delta: -19.3MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-10-24 05:39:13,173 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 249.6MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:39:13,175 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 184.5MB. Free memory is still 149.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.03ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 118.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 184.5MB. Free memory was 118.1MB in the beginning and 115.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.78ms. Allocated memory is still 184.5MB. Free memory was 115.6MB in the beginning and 112.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 532.18ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 90.8MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4479.18ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 90.0MB in the beginning and 109.3MB in the end (delta: -19.3MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 249.6MB. Free memory is still 109.3MB. 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 121, overapproximation of someUnaryDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] unsigned long int last_1_var_1_10 = 128; [L40] unsigned long int last_1_var_1_16 = 1; [L41] double last_1_var_1_19 = 3.8; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L116] last_1_var_1_10 = var_1_10 [L117] last_1_var_1_16 = var_1_16 [L118] last_1_var_1_19 = var_1_19 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L97] var_1_8 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L100] var_1_9 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L101] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L103] var_1_11 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L106] var_1_17 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L107] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L109] var_1_18 = __VERIFIER_nondet_ulong() [L110] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L110] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L111] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L112] var_1_20 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L113] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L129] RET updateVariables() [L130] CALL step() [L45] unsigned long int stepLocal_1 = last_1_var_1_16; [L46] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L47] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L48] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L56] COND TRUE var_1_12 == var_1_12 [L57] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L59] var_1_1 = (var_1_2 || (! var_1_3)) [L60] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L61] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L62] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L63] COND FALSE !(var_1_19 >= var_1_19) [L68] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L73] COND TRUE var_1_19 != var_1_19 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L82] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L83] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L84] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284986, var_1_11=1073741823, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=4294967294, var_1_18=6442450943, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=1, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 597 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 251 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457 SizeOfPredicates, 3 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3147/3264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:39:13,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.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 8bd8cdb54252e3a41260d832748f2d7f7ae2fd523d0e88c7d7f11f40d448b7f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:39:15,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:39:15,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:39:15,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:39:15,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:39:15,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:39:15,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:39:15,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:39:15,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:39:15,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:39:15,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:39:15,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:39:15,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:39:15,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:39:15,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:39:15,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:39:15,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:39:15,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:39:15,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:39:15,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:39:15,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:39:15,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:39:15,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:39:15,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:39:15,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:39:15,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:39:15,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:39:15,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:39:15,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:39:15,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:39:15,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:39:15,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:39:15,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:39:15,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:39:15,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:39:15,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:39:15,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:39:15,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:39:15,532 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:39:15,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:39:15,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:39:15,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:39:15,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:39:15,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:39:15,533 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:39:15,533 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 -> 8bd8cdb54252e3a41260d832748f2d7f7ae2fd523d0e88c7d7f11f40d448b7f4 [2024-10-24 05:39:15,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:39:15,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:39:15,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:39:15,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:39:15,867 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:39:15,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:17,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:39:17,566 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:39:17,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:17,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70bab3e9/255ac8ee62954778ade8f091600130c1/FLAG6798f52fa [2024-10-24 05:39:17,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c70bab3e9/255ac8ee62954778ade8f091600130c1 [2024-10-24 05:39:17,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:39:17,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:39:17,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:39:17,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:39:17,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:39:17,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:39:17" (1/1) ... [2024-10-24 05:39:17,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff5422f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:17, skipping insertion in model container [2024-10-24 05:39:17,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:39:17" (1/1) ... [2024-10-24 05:39:17,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:39:18,140 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i[913,926] [2024-10-24 05:39:18,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:39:18,233 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:39:18,247 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-11.i[913,926] [2024-10-24 05:39:18,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:39:18,333 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:39:18,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18 WrapperNode [2024-10-24 05:39:18,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:39:18,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:39:18,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:39:18,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:39:18,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,394 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-24 05:39:18,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:39:18,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:39:18,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:39:18,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:39:18,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:39:18,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:39:18,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:39:18,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:39:18,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:39:18,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (1/1) ... [2024-10-24 05:39:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:39:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:39:18,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:39:18,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:39:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:39:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:39:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:39:18,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:39:18,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:39:18,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:39:18,646 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:39:18,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:39:18,964 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 05:39:18,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:39:19,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:39:19,031 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:39:19,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:39:19 BoogieIcfgContainer [2024-10-24 05:39:19,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:39:19,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:39:19,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:39:19,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:39:19,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:39:17" (1/3) ... [2024-10-24 05:39:19,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e1ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:39:19, skipping insertion in model container [2024-10-24 05:39:19,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:39:18" (2/3) ... [2024-10-24 05:39:19,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e1ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:39:19, skipping insertion in model container [2024-10-24 05:39:19,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:39:19" (3/3) ... [2024-10-24 05:39:19,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-11.i [2024-10-24 05:39:19,060 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:39:19,060 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:39:19,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:39:19,140 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;@7cc02b19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:39:19,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:39:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:39:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 05:39:19,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:19,159 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:19,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 990375764, now seen corresponding path program 1 times [2024-10-24 05:39:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:39:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314698974] [2024-10-24 05:39:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:19,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:19,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:39:19,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:39:19,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:39:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:19,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:39:19,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:39:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-10-24 05:39:19,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:39:19,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:39:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314698974] [2024-10-24 05:39:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314698974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:19,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:19,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:39:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896630852] [2024-10-24 05:39:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:19,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:39:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:39:19,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:39:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:39:19,479 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 05:39:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:19,536 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-24 05:39:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:39:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 106 [2024-10-24 05:39:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:19,552 INFO L225 Difference]: With dead ends: 99 [2024-10-24 05:39:19,552 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 05:39:19,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:39:19,562 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:19,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:39:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 05:39:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 05:39:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 05:39:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-24 05:39:19,614 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 106 [2024-10-24 05:39:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:19,616 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-24 05:39:19,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 05:39:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-24 05:39:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 05:39:19,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:19,620 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:19,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:39:19,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:19,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:19,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -123222896, now seen corresponding path program 1 times [2024-10-24 05:39:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:39:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838127572] [2024-10-24 05:39:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:19,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:19,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:39:19,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:39:19,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:39:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:19,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 05:39:19,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:39:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 05:39:20,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:39:20,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:39:20,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838127572] [2024-10-24 05:39:20,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838127572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:39:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193642763] [2024-10-24 05:39:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:20,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:39:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:39:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:39:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:39:20,640 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:20,938 INFO L93 Difference]: Finished difference Result 146 states and 221 transitions. [2024-10-24 05:39:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:39:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2024-10-24 05:39:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:20,945 INFO L225 Difference]: With dead ends: 146 [2024-10-24 05:39:20,945 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 05:39:20,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:39:20,947 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 45 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:20,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 236 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:39:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 05:39:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-10-24 05:39:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:39:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-10-24 05:39:20,986 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 106 [2024-10-24 05:39:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:20,987 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-10-24 05:39:20,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-10-24 05:39:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 05:39:20,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:20,989 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:20,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:39:21,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:21,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:21,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 797510062, now seen corresponding path program 1 times [2024-10-24 05:39:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:39:21,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372834849] [2024-10-24 05:39:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:39:21,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:39:21,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 05:39:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:21,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 05:39:21,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:39:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-24 05:39:21,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:39:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 05:39:21,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:39:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372834849] [2024-10-24 05:39:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372834849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:39:21,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:39:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-24 05:39:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509869455] [2024-10-24 05:39:21,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:39:21,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:39:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:39:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:39:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:39:21,810 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 05:39:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:22,221 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2024-10-24 05:39:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 05:39:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 107 [2024-10-24 05:39:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:22,227 INFO L225 Difference]: With dead ends: 145 [2024-10-24 05:39:22,227 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 05:39:22,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:39:22,229 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 156 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:22,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 104 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:39:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 05:39:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-10-24 05:39:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:39:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-10-24 05:39:22,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 107 [2024-10-24 05:39:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:22,309 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-24 05:39:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 05:39:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-10-24 05:39:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 05:39:22,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:22,311 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:22,320 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 (4)] Ended with exit code 0 [2024-10-24 05:39:22,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:22,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:22,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1856579691, now seen corresponding path program 1 times [2024-10-24 05:39:22,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:39:22,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852274306] [2024-10-24 05:39:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:22,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:39:22,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:39:22,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 05:39:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:22,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 05:39:22,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:39:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 05:39:22,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:39:22,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:39:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852274306] [2024-10-24 05:39:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852274306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:39:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:39:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:39:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804062314] [2024-10-24 05:39:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:39:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:39:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:39:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:39:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:39:22,907 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:39:23,150 INFO L93 Difference]: Finished difference Result 145 states and 206 transitions. [2024-10-24 05:39:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:39:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-24 05:39:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:39:23,153 INFO L225 Difference]: With dead ends: 145 [2024-10-24 05:39:23,153 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 05:39:23,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:39:23,155 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:39:23,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:39:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 05:39:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-10-24 05:39:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 05:39:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2024-10-24 05:39:23,187 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 108 [2024-10-24 05:39:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:39:23,188 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2024-10-24 05:39:23,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 05:39:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2024-10-24 05:39:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 05:39:23,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:39:23,190 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:39:23,199 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 (5)] Ended with exit code 0 [2024-10-24 05:39:23,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:23,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:39:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:39:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1812318986, now seen corresponding path program 1 times [2024-10-24 05:39:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:39:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305008217] [2024-10-24 05:39:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:39:23,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:39:23,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:39:23,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:39:23,402 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 (6)] Waiting until timeout for monitored process [2024-10-24 05:39:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:39:23,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 05:39:23,518 INFO L278 TraceCheckSpWp]: Computing forward predicates...