./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.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 d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:22:41,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:22:41,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:22:41,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:22:41,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:22:41,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:22:41,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:22:41,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:22:41,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:22:41,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:22:41,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:22:41,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:22:41,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:22:41,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:22:41,640 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:22:41,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:22:41,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:22:41,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:22:41,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:22:41,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:22:41,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:22:41,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:22:41,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:41,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:22:41,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:22:41,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:22:41,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:22:41,648 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 -> d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 [2024-11-16 14:22:41,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:22:41,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:22:41,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:22:41,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:22:41,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:22:41,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:43,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:22:43,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:22:43,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:43,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcec495d1/e613d5676cc44118860ca8a52618d385/FLAG1ff9d4b1b [2024-11-16 14:22:43,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcec495d1/e613d5676cc44118860ca8a52618d385 [2024-11-16 14:22:43,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:22:43,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:22:43,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:43,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:22:43,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:22:43,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e2e631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43, skipping insertion in model container [2024-11-16 14:22:43,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:22:43,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i[919,932] [2024-11-16 14:22:43,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:43,493 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:22:43,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i[919,932] [2024-11-16 14:22:43,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:43,543 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:22:43,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43 WrapperNode [2024-11-16 14:22:43,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:43,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:43,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:22:43,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:22:43,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,589 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-16 14:22:43,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:43,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:22:43,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:22:43,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:22:43,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,625 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:22:43,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:22:43,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:22:43,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:22:43,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:22:43,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (1/1) ... [2024-11-16 14:22:43,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:43,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:22:43,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:22:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:22:43,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:22:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:22:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:22:43,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:22:43,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:22:43,789 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:22:43,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:22:44,066 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 14:22:44,067 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:22:44,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:22:44,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:22:44,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:44 BoogieIcfgContainer [2024-11-16 14:22:44,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:22:44,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:22:44,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:22:44,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:22:44,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:22:43" (1/3) ... [2024-11-16 14:22:44,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9501d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:44, skipping insertion in model container [2024-11-16 14:22:44,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:43" (2/3) ... [2024-11-16 14:22:44,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d9501d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:44, skipping insertion in model container [2024-11-16 14:22:44,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:44" (3/3) ... [2024-11-16 14:22:44,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:44,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:22:44,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:22:44,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:22:44,175 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;@709f785d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:22:44,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:22:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:22:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:22:44,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:44,192 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:44,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -358388025, now seen corresponding path program 1 times [2024-11-16 14:22:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181842477] [2024-11-16 14:22:44,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:22:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181842477] [2024-11-16 14:22:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181842477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:22:44,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299554312] [2024-11-16 14:22:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:44,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:22:44,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:22:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:44,585 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 14:22:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:44,620 INFO L93 Difference]: Finished difference Result 148 states and 247 transitions. [2024-11-16 14:22:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:22:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-11-16 14:22:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:44,660 INFO L225 Difference]: With dead ends: 148 [2024-11-16 14:22:44,660 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 14:22:44,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:44,668 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:44,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:22:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 14:22:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 14:22:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:22:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-11-16 14:22:44,712 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 132 [2024-11-16 14:22:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:44,713 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-11-16 14:22:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 14:22:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-11-16 14:22:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:44,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:44,717 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:44,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:22:44,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -207728895, now seen corresponding path program 1 times [2024-11-16 14:22:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504225124] [2024-11-16 14:22:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:22:45,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:45,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504225124] [2024-11-16 14:22:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504225124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:45,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:22:45,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315877663] [2024-11-16 14:22:45,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:45,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:22:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:22:45,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:22:45,015 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:45,176 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2024-11-16 14:22:45,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:22:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-16 14:22:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:45,183 INFO L225 Difference]: With dead ends: 190 [2024-11-16 14:22:45,184 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 14:22:45,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:22:45,186 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 59 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:45,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 313 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:22:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 14:22:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-16 14:22:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 84 states have internal predecessors, (111), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-11-16 14:22:45,212 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 133 [2024-11-16 14:22:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:45,212 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-11-16 14:22:45,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2024-11-16 14:22:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:45,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:45,216 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:45,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:22:45,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -616553120, now seen corresponding path program 1 times [2024-11-16 14:22:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:45,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688009756] [2024-11-16 14:22:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:22:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688009756] [2024-11-16 14:22:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688009756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:22:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328466148] [2024-11-16 14:22:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:22:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:22:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:22:45,393 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:45,413 INFO L93 Difference]: Finished difference Result 229 states and 339 transitions. [2024-11-16 14:22:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:22:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-16 14:22:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:45,416 INFO L225 Difference]: With dead ends: 229 [2024-11-16 14:22:45,416 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 14:22:45,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:22:45,418 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:45,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:22:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 14:22:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-16 14:22:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-11-16 14:22:45,431 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 133 [2024-11-16 14:22:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:45,432 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-11-16 14:22:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-11-16 14:22:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:45,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:45,438 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:45,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:22:45,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1122111745, now seen corresponding path program 1 times [2024-11-16 14:22:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:45,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653313494] [2024-11-16 14:22:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:22:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:45,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653313494] [2024-11-16 14:22:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653313494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:22:45,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366958175] [2024-11-16 14:22:45,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:45,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:22:45,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:45,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:22:45,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:22:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:45,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:22:45,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:22:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 14:22:46,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:22:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:22:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366958175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:22:46,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:22:46,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 14:22:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328032932] [2024-11-16 14:22:46,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:22:46,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:22:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:46,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:22:46,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:22:46,207 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:22:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:46,339 INFO L93 Difference]: Finished difference Result 243 states and 345 transitions. [2024-11-16 14:22:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:22:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 133 [2024-11-16 14:22:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:46,343 INFO L225 Difference]: With dead ends: 243 [2024-11-16 14:22:46,344 INFO L226 Difference]: Without dead ends: 130 [2024-11-16 14:22:46,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:22:46,347 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:46,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 183 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:22:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-16 14:22:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-11-16 14:22:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 88 states have internal predecessors, (107), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2024-11-16 14:22:46,358 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 133 [2024-11-16 14:22:46,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:46,358 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2024-11-16 14:22:46,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:22:46,359 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2024-11-16 14:22:46,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:46,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:46,360 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:46,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 14:22:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:22:46,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash 290327391, now seen corresponding path program 1 times [2024-11-16 14:22:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:46,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291962270] [2024-11-16 14:22:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:22:46,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:46,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291962270] [2024-11-16 14:22:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291962270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:46,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:22:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759532900] [2024-11-16 14:22:46,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:46,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:22:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:46,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:22:46,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:22:46,805 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:46,874 INFO L93 Difference]: Finished difference Result 332 states and 454 transitions. [2024-11-16 14:22:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:22:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-16 14:22:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:46,876 INFO L225 Difference]: With dead ends: 332 [2024-11-16 14:22:46,876 INFO L226 Difference]: Without dead ends: 205 [2024-11-16 14:22:46,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:22:46,877 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 72 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:46,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 246 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:22:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-16 14:22:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2024-11-16 14:22:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 152 states have internal predecessors, (186), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 14:22:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 274 transitions. [2024-11-16 14:22:46,902 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 274 transitions. Word has length 133 [2024-11-16 14:22:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 274 transitions. [2024-11-16 14:22:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:22:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 274 transitions. [2024-11-16 14:22:46,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:46,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:46,903 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:46,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:22:46,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:46,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 223320638, now seen corresponding path program 1 times [2024-11-16 14:22:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797095001] [2024-11-16 14:22:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:22:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:22:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:22:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:22:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:22:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:22:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:22:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:22:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:22:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:22:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:22:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:22:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 14:22:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:22:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:22:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 14:22:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 14:22:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 14:22:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:22:47,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:22:47,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797095001] [2024-11-16 14:22:47,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797095001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:22:47,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413783462] [2024-11-16 14:22:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:47,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:22:47,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:47,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:22:47,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:22:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:47,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:22:47,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:22:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-16 14:22:47,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:22:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:22:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413783462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:22:47,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:22:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2024-11-16 14:22:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623969197] [2024-11-16 14:22:47,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:22:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 14:22:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:22:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 14:22:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:22:47,780 INFO L87 Difference]: Start difference. First operand 200 states and 274 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 14:22:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:48,861 INFO L93 Difference]: Finished difference Result 730 states and 957 transitions. [2024-11-16 14:22:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 14:22:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 133 [2024-11-16 14:22:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:48,865 INFO L225 Difference]: With dead ends: 730 [2024-11-16 14:22:48,865 INFO L226 Difference]: Without dead ends: 533 [2024-11-16 14:22:48,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=389, Invalid=1093, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 14:22:48,867 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 404 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:48,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 376 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 14:22:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-16 14:22:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 141. [2024-11-16 14:22:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.174757281553398) internal successors, (121), 104 states have internal predecessors, (121), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:22:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2024-11-16 14:22:48,895 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 133 [2024-11-16 14:22:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:48,895 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2024-11-16 14:22:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 14:22:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2024-11-16 14:22:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 14:22:48,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:48,897 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:48,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:22:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 14:22:49,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:49,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1584133825, now seen corresponding path program 1 times [2024-11-16 14:22:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:22:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695944885] [2024-11-16 14:22:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:22:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:22:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923500894] [2024-11-16 14:22:49,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:49,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:22:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:49,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:22:49,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:22:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:22:49,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:22:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:22:49,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:22:49,406 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:22:49,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:22:49,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 14:22:49,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:22:49,612 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:49,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:22:49,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:22:49 BoogieIcfgContainer [2024-11-16 14:22:49,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:22:49,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:22:49,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:22:49,703 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:22:49,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:44" (3/4) ... [2024-11-16 14:22:49,705 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:22:49,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:22:49,706 INFO L158 Benchmark]: Toolchain (without parser) took 6455.64ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 154.2MB in the beginning and 157.1MB in the end (delta: -2.9MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-11-16 14:22:49,706 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 82.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:22:49,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.49ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 136.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 14:22:49,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.18ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:22:49,707 INFO L158 Benchmark]: Boogie Preprocessor took 47.74ms. Allocated memory is still 186.6MB. Free memory was 132.4MB in the beginning and 125.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:22:49,707 INFO L158 Benchmark]: IcfgBuilder took 454.77ms. Allocated memory is still 186.6MB. Free memory was 125.0MB in the beginning and 97.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 14:22:49,707 INFO L158 Benchmark]: TraceAbstraction took 5607.11ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 96.7MB in the beginning and 157.1MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:22:49,708 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 224.4MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:22:49,708 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.14ms. Allocated memory is still 121.6MB. Free memory was 82.8MB in the beginning and 82.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.49ms. Allocated memory is still 186.6MB. Free memory was 154.2MB in the beginning and 136.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.18ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 132.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.74ms. Allocated memory is still 186.6MB. Free memory was 132.4MB in the beginning and 125.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 454.77ms. Allocated memory is still 186.6MB. Free memory was 125.0MB in the beginning and 97.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5607.11ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 96.7MB in the beginning and 157.1MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 224.4MB. Free memory is still 157.1MB. 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 someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L144] 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_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L64] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L66] COND TRUE var_1_11 || var_1_10 [L67] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L69] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L71] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L73] COND FALSE !(var_1_9 && var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L76] var_1_35 = var_1_20 [L77] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L78] COND FALSE !((var_1_11 && var_1_9) && (var_1_12 > var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L81] EXPR var_1_8 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L81] COND FALSE !(var_1_28 > (var_1_8 | var_1_12)) [L84] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L87] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L89] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L90] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_24)) ? ((var_1_20 / var_1_39)) : (var_1_24))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_46 = var_1_15 [L105] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L106] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L111] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L112] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L113] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L117] COND FALSE !(var_1_12 > ((var_1_29 >> 1) + var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=-1, var_1_8=0, var_1_9=0] [L120] var_1_47 = var_1_4 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] [L121] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] [L124] var_1_45 = var_1_28 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=-1, var_1_4=-1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 606 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 1434 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 789 mSDsCounter, 403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 403 mSolverCounterUnsat, 645 mSDtfsCounter, 892 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 823 GetRequests, 769 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=5, InterpolantAutomatonStates: 54, 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, 6 MinimizatonAttempts, 409 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 2636 SizeOfPredicates, 8 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 6012/6120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 14:22:49,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.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 d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:22:51,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:22:51,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:22:51,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:22:51,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:22:51,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:22:51,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:22:51,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:22:51,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:22:51,513 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:22:51,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:22:51,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:22:51,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:22:51,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:22:51,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:22:51,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:22:51,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:22:51,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:22:51,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:22:51,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:22:51,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:22:51,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:22:51,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:22:51,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:22:51,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:22:51,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:22:51,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:22:51,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:22:51,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:22:51,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:51,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:22:51,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:22:51,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:22:51,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:22:51,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:22:51,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:22:51,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:22:51,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:22:51,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:22:51,525 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 -> d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 [2024-11-16 14:22:51,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:22:51,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:22:51,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:22:51,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:22:51,781 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:22:51,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:53,078 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:22:53,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:22:53,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:53,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb19ba15/8a14128ec2e248759c8a7f881b0e68d6/FLAGdc9c0b484 [2024-11-16 14:22:53,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb19ba15/8a14128ec2e248759c8a7f881b0e68d6 [2024-11-16 14:22:53,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:22:53,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:22:53,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:53,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:22:53,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:22:53,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb6e938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53, skipping insertion in model container [2024-11-16 14:22:53,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:22:53,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i[919,932] [2024-11-16 14:22:53,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:53,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:22:53,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i[919,932] [2024-11-16 14:22:53,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:22:53,614 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:22:53,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53 WrapperNode [2024-11-16 14:22:53,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:22:53,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:53,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:22:53,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:22:53,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,652 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-16 14:22:53,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:22:53,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:22:53,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:22:53,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:22:53,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:22:53,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:22:53,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:22:53,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:22:53,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:22:53,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (1/1) ... [2024-11-16 14:22:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:22:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:22:53,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:22:53,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:22:53,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:22:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:22:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:22:53,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:22:53,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:22:53,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:22:53,840 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:22:53,841 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:22:56,333 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 14:22:56,334 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:22:56,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:22:56,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:22:56,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:56 BoogieIcfgContainer [2024-11-16 14:22:56,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:22:56,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:22:56,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:22:56,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:22:56,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:22:53" (1/3) ... [2024-11-16 14:22:56,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f719d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:56, skipping insertion in model container [2024-11-16 14:22:56,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:22:53" (2/3) ... [2024-11-16 14:22:56,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f719d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:22:56, skipping insertion in model container [2024-11-16 14:22:56,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:22:56" (3/3) ... [2024-11-16 14:22:56,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-11-16 14:22:56,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:22:56,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:22:56,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:22:56,412 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;@27c1d8fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:22:56,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:22:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:22:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 14:22:56,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:56,426 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:56,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 313561342, now seen corresponding path program 1 times [2024-11-16 14:22:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:22:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191264668] [2024-11-16 14:22:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:22:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:22:56,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:22:56,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 14:22:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:56,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:22:56,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:22:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-16 14:22:56,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:22:56,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:22:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191264668] [2024-11-16 14:22:56,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191264668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:22:56,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:22:56,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:22:56,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164360522] [2024-11-16 14:22:56,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:22:56,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:22:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:22:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:22:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:56,858 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 14:22:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:56,885 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2024-11-16 14:22:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:22:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2024-11-16 14:22:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:56,891 INFO L225 Difference]: With dead ends: 142 [2024-11-16 14:22:56,892 INFO L226 Difference]: Without dead ends: 70 [2024-11-16 14:22:56,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:22:56,899 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:56,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:22:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-16 14:22:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-16 14:22:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:22:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2024-11-16 14:22:56,950 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 131 [2024-11-16 14:22:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:56,951 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2024-11-16 14:22:56,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 14:22:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-11-16 14:22:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:22:56,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:56,955 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 14:22:57,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:22:57,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1233843610, now seen corresponding path program 1 times [2024-11-16 14:22:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:22:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465771341] [2024-11-16 14:22:57,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:57,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:22:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:22:57,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:22:57,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 14:22:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:22:57,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 14:22:57,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:22:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 344 proven. 57 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-16 14:22:58,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:22:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:22:58,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:22:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465771341] [2024-11-16 14:22:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465771341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:22:58,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:22:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-16 14:22:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417278133] [2024-11-16 14:22:58,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:22:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 14:22:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:22:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 14:22:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:22:58,512 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-16 14:22:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:22:59,492 INFO L93 Difference]: Finished difference Result 194 states and 275 transitions. [2024-11-16 14:22:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 14:22:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 132 [2024-11-16 14:22:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:22:59,498 INFO L225 Difference]: With dead ends: 194 [2024-11-16 14:22:59,498 INFO L226 Difference]: Without dead ends: 127 [2024-11-16 14:22:59,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2024-11-16 14:22:59,500 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 14:22:59,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 498 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 14:22:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-16 14:22:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2024-11-16 14:22:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 88 states have internal predecessors, (111), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 14:22:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 157 transitions. [2024-11-16 14:22:59,520 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 157 transitions. Word has length 132 [2024-11-16 14:22:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:22:59,521 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 157 transitions. [2024-11-16 14:22:59,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 4 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-16 14:22:59,521 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 157 transitions. [2024-11-16 14:22:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:22:59,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:22:59,524 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:22:59,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 14:22:59,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:22:59,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:22:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:22:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1799957815, now seen corresponding path program 1 times [2024-11-16 14:22:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:22:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888309834] [2024-11-16 14:22:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:22:59,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:22:59,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:22:59,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:22:59,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 14:23:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:00,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 14:23:00,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 14:23:00,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:23:00,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:23:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888309834] [2024-11-16 14:23:00,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888309834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:23:00,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:23:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-16 14:23:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670833330] [2024-11-16 14:23:00,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 14:23:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:23:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 14:23:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:23:00,441 INFO L87 Difference]: Start difference. First operand 115 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:23:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:01,051 INFO L93 Difference]: Finished difference Result 316 states and 427 transitions. [2024-11-16 14:23:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 14:23:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 132 [2024-11-16 14:23:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:01,054 INFO L225 Difference]: With dead ends: 316 [2024-11-16 14:23:01,054 INFO L226 Difference]: Without dead ends: 204 [2024-11-16 14:23:01,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-16 14:23:01,057 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 323 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:01,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 297 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 14:23:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-16 14:23:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2024-11-16 14:23:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 137 states have internal predecessors, (171), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-16 14:23:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 253 transitions. [2024-11-16 14:23:01,080 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 253 transitions. Word has length 132 [2024-11-16 14:23:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:01,081 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 253 transitions. [2024-11-16 14:23:01,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:23:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 253 transitions. [2024-11-16 14:23:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:23:01,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:01,082 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:01,098 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-11-16 14:23:01,283 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-11-16 14:23:01,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:01,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash -555193334, now seen corresponding path program 1 times [2024-11-16 14:23:01,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:23:01,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659796219] [2024-11-16 14:23:01,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:01,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:23:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:23:01,290 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-11-16 14:23:01,291 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-11-16 14:23:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:01,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 14:23:01,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 14:23:01,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:23:01,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:23:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659796219] [2024-11-16 14:23:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659796219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198124808] [2024-11-16 14:23:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:01,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:23:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:01,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:01,598 INFO L87 Difference]: Start difference. First operand 185 states and 253 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:23:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:01,686 INFO L93 Difference]: Finished difference Result 367 states and 503 transitions. [2024-11-16 14:23:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:01,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2024-11-16 14:23:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:01,696 INFO L225 Difference]: With dead ends: 367 [2024-11-16 14:23:01,696 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 14:23:01,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:01,699 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:01,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:23:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 14:23:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-16 14:23:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 137 states have internal predecessors, (168), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-16 14:23:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2024-11-16 14:23:01,716 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 132 [2024-11-16 14:23:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:01,717 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2024-11-16 14:23:01,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 14:23:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2024-11-16 14:23:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:23:01,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:01,719 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:01,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 14:23:01,919 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-11-16 14:23:01,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:01,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1060751959, now seen corresponding path program 1 times [2024-11-16 14:23:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:23:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288470492] [2024-11-16 14:23:01,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:23:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:23:01,923 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-11-16 14:23:01,925 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-11-16 14:23:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:02,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:23:02,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:23:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-16 14:23:02,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:23:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-16 14:23:02,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:23:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288470492] [2024-11-16 14:23:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288470492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:23:02,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:23:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-16 14:23:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575144196] [2024-11-16 14:23:02,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:23:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 14:23:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:23:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 14:23:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:23:02,798 INFO L87 Difference]: Start difference. First operand 185 states and 250 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 14:23:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:04,274 INFO L93 Difference]: Finished difference Result 578 states and 746 transitions. [2024-11-16 14:23:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 14:23:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 132 [2024-11-16 14:23:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:04,278 INFO L225 Difference]: With dead ends: 578 [2024-11-16 14:23:04,278 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 14:23:04,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-11-16 14:23:04,280 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 254 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 190 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 14:23:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 14:23:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 164. [2024-11-16 14:23:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 117 states have internal predecessors, (138), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 14:23:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 210 transitions. [2024-11-16 14:23:04,298 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 210 transitions. Word has length 132 [2024-11-16 14:23:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 210 transitions. [2024-11-16 14:23:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 14:23:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 210 transitions. [2024-11-16 14:23:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 14:23:04,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:04,300 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:04,311 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 (6)] Ended with exit code 0 [2024-11-16 14:23:04,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:23:04,501 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:04,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1426760874, now seen corresponding path program 1 times [2024-11-16 14:23:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:23:04,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747719150] [2024-11-16 14:23:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:23:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:23:04,503 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:23:04,503 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 (7)] Waiting until timeout for monitored process [2024-11-16 14:23:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 14:23:04,798 INFO L278 TraceCheckSpWp]: Computing forward predicates...