./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:27:27,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:27:27,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:27:27,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:27:27,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:27:27,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:27:27,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:27:27,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:27:27,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:27:27,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:27:27,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:27:27,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:27:27,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:27:27,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:27:27,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:27:27,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:27:27,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:27:27,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:27:27,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:27:27,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:27:27,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:27:27,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:27:27,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:27:27,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:27:27,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:27:27,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:27:27,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:27:27,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:27:27,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:27:27,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:27:27,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:27:27,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:27:27,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:27,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:27:27,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:27:27,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:27:27,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:27:27,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:27:27,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:27:27,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:27:27,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:27:27,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:27:27,466 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2024-11-10 05:27:27,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:27:27,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:27:27,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:27:27,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:27:27,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:27:27,748 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-42.i [2024-11-10 05:27:29,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:27:29,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:27:29,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-10 05:27:29,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e001c04/51458cd9481d451d956403545e44596b/FLAG3a995eaee [2024-11-10 05:27:29,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e001c04/51458cd9481d451d956403545e44596b [2024-11-10 05:27:29,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:27:29,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:27:29,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:29,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:27:29,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:27:29,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:29" (1/1) ... [2024-11-10 05:27:29,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6325b137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:29, skipping insertion in model container [2024-11-10 05:27:29,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:29" (1/1) ... [2024-11-10 05:27:29,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:27:30,025 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-42.i[919,932] [2024-11-10 05:27:30,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:30,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:27:30,134 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-42.i[919,932] [2024-11-10 05:27:30,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:30,205 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:27:30,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30 WrapperNode [2024-11-10 05:27:30,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:30,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:30,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:27:30,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:27:30,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,220 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,249 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-10 05:27:30,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:30,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:27:30,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:27:30,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:27:30,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,275 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-10 05:27:30,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:27:30,289 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:27:30,289 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:27:30,289 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:27:30,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (1/1) ... [2024-11-10 05:27:30,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:30,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:30,325 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-10 05:27:30,328 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-10 05:27:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:27:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:27:30,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:27:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:27:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:27:30,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:27:30,453 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:27:30,455 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:27:30,745 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 05:27:30,746 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:27:30,756 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:27:30,756 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:27:30,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:30 BoogieIcfgContainer [2024-11-10 05:27:30,757 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:27:30,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:27:30,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:27:30,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:27:30,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:29" (1/3) ... [2024-11-10 05:27:30,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1151e215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:30, skipping insertion in model container [2024-11-10 05:27:30,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:30" (2/3) ... [2024-11-10 05:27:30,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1151e215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:30, skipping insertion in model container [2024-11-10 05:27:30,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:30" (3/3) ... [2024-11-10 05:27:30,766 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-10 05:27:30,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:27:30,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:27:30,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:27:30,839 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;@53c66269, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:27:30,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:27:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 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-10 05:27:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 05:27:30,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:30,859 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-10 05:27:30,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:30,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1650203955, now seen corresponding path program 1 times [2024-11-10 05:27:30,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:30,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448259121] [2024-11-10 05:27:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,272 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-10 05:27:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448259121] [2024-11-10 05:27:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448259121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:31,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:27:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073080207] [2024-11-10 05:27:31,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:31,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:27:31,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:27:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:31,327 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 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.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10 05:27:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:31,398 INFO L93 Difference]: Finished difference Result 141 states and 241 transitions. [2024-11-10 05:27:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:27:31,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 131 [2024-11-10 05:27:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:31,406 INFO L225 Difference]: With dead ends: 141 [2024-11-10 05:27:31,407 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 05:27:31,410 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-10 05:27:31,412 INFO L432 NwaCegarLoop]: 105 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, 105 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-10 05:27:31,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 05:27:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 05:27:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 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-10 05:27:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-11-10 05:27:31,450 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 131 [2024-11-10 05:27:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:31,451 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-11-10 05:27:31,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-10 05:27:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-11-10 05:27:31,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 05:27:31,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:31,456 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-10 05:27:31,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:27:31,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:31,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 401102453, now seen corresponding path program 1 times [2024-11-10 05:27:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793409075] [2024-11-10 05:27:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:31,991 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-10 05:27:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793409075] [2024-11-10 05:27:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793409075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:27:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191792376] [2024-11-10 05:27:31,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:31,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:27:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:27:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:27:31,997 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10 05:27:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:32,154 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-10 05:27:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:27:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 131 [2024-11-10 05:27:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:32,159 INFO L225 Difference]: With dead ends: 203 [2024-11-10 05:27:32,161 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 05:27:32,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:32,162 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 110 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:32,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 297 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:27:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 05:27:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-10 05:27:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:27:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-10 05:27:32,192 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 131 [2024-11-10 05:27:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:32,194 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-10 05:27:32,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-10 05:27:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-10 05:27:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:32,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:32,197 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-10 05:27:32,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:27:32,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:32,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash -437283088, now seen corresponding path program 1 times [2024-11-10 05:27:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017907957] [2024-11-10 05:27:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:32,660 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-10 05:27:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017907957] [2024-11-10 05:27:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017907957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:27:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745418755] [2024-11-10 05:27:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:27:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:27:32,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:32,663 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-10 05:27:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:32,980 INFO L93 Difference]: Finished difference Result 302 states and 468 transitions. [2024-11-10 05:27:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:27:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-10 05:27:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:32,983 INFO L225 Difference]: With dead ends: 302 [2024-11-10 05:27:32,983 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 05:27:32,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:27:32,985 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 158 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:32,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 463 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:27:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 05:27:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 168. [2024-11-10 05:27:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 05:27:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 257 transitions. [2024-11-10 05:27:33,024 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 257 transitions. Word has length 132 [2024-11-10 05:27:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:33,025 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 257 transitions. [2024-11-10 05:27:33,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-10 05:27:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 257 transitions. [2024-11-10 05:27:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:33,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:33,029 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-10 05:27:33,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:27:33,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1780474865, now seen corresponding path program 1 times [2024-11-10 05:27:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:33,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945142016] [2024-11-10 05:27:33,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,254 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-10 05:27:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945142016] [2024-11-10 05:27:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945142016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:33,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748233378] [2024-11-10 05:27:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:33,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:33,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:33,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:33,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:33,257 INFO L87 Difference]: Start difference. First operand 168 states and 257 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-10 05:27:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:33,297 INFO L93 Difference]: Finished difference Result 297 states and 458 transitions. [2024-11-10 05:27:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:33,299 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-10 05:27:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:33,301 INFO L225 Difference]: With dead ends: 297 [2024-11-10 05:27:33,301 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 05:27:33,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-10 05:27:33,305 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:33,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 05:27:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-10 05:27:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 110 states have internal predecessors, (147), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 05:27:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2024-11-10 05:27:33,321 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 132 [2024-11-10 05:27:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:33,322 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2024-11-10 05:27:33,322 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-10 05:27:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2024-11-10 05:27:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:33,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:33,323 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-10 05:27:33,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:27:33,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:33,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1909557584, now seen corresponding path program 1 times [2024-11-10 05:27:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:33,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519364485] [2024-11-10 05:27:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-10 05:27:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519364485] [2024-11-10 05:27:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519364485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171944978] [2024-11-10 05:27:33,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:33,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:33,750 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-10 05:27:33,751 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-10 05:27:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:33,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 05:27:33,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-10 05:27:34,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-10 05:27:35,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171944978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:27:35,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:27:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 25 [2024-11-10 05:27:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352552769] [2024-11-10 05:27:35,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:35,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 05:27:35,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:35,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 05:27:35,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2024-11-10 05:27:35,130 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 7 states have call successors, (51), 4 states have call predecessors, (51), 9 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-10 05:27:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:38,891 INFO L93 Difference]: Finished difference Result 991 states and 1372 transitions. [2024-11-10 05:27:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-10 05:27:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 7 states have call successors, (51), 4 states have call predecessors, (51), 9 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) Word has length 132 [2024-11-10 05:27:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:38,899 INFO L225 Difference]: With dead ends: 991 [2024-11-10 05:27:38,900 INFO L226 Difference]: Without dead ends: 862 [2024-11-10 05:27:38,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2550, Invalid=13200, Unknown=0, NotChecked=0, Total=15750 [2024-11-10 05:27:38,907 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 2097 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:38,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2098 Valid, 1144 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 05:27:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-10 05:27:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 365. [2024-11-10 05:27:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.2676579925650557) internal successors, (341), 271 states have internal predecessors, (341), 76 states have call successors, (76), 19 states have call predecessors, (76), 19 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-10 05:27:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 493 transitions. [2024-11-10 05:27:38,952 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 493 transitions. Word has length 132 [2024-11-10 05:27:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 493 transitions. [2024-11-10 05:27:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.0) internal successors, (125), 25 states have internal predecessors, (125), 7 states have call successors, (51), 4 states have call predecessors, (51), 9 states have return successors, (52), 7 states have call predecessors, (52), 7 states have call successors, (52) [2024-11-10 05:27:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 493 transitions. [2024-11-10 05:27:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:38,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:38,954 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-10 05:27:38,969 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-10 05:27:39,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:39,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash -296218000, now seen corresponding path program 1 times [2024-11-10 05:27:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570291496] [2024-11-10 05:27:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:27:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543797576] [2024-11-10 05:27:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:39,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:39,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:39,221 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-10 05:27:39,225 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-10 05:27:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:39,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 05:27:39,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-10 05:27:40,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570291496] [2024-11-10 05:27:45,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 05:27:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543797576] [2024-11-10 05:27:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543797576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:27:45,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:27:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-10 05:27:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375118273] [2024-11-10 05:27:45,725 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 05:27:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 05:27:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2024-11-10 05:27:45,726 INFO L87 Difference]: Start difference. First operand 365 states and 493 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 05:27:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:46,911 INFO L93 Difference]: Finished difference Result 1063 states and 1431 transitions. [2024-11-10 05:27:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:27:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2024-11-10 05:27:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:46,917 INFO L225 Difference]: With dead ends: 1063 [2024-11-10 05:27:46,918 INFO L226 Difference]: Without dead ends: 765 [2024-11-10 05:27:46,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=109, Invalid=270, Unknown=1, NotChecked=0, Total=380 [2024-11-10 05:27:46,919 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 142 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:46,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 441 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:27:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2024-11-10 05:27:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 652. [2024-11-10 05:27:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 484 states have (on average 1.2685950413223142) internal successors, (614), 488 states have internal predecessors, (614), 134 states have call successors, (134), 33 states have call predecessors, (134), 33 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-10 05:27:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 882 transitions. [2024-11-10 05:27:46,976 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 882 transitions. Word has length 132 [2024-11-10 05:27:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 882 transitions. [2024-11-10 05:27:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 05:27:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 882 transitions. [2024-11-10 05:27:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 05:27:46,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:46,978 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-10 05:27:46,996 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-10 05:27:47,182 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-10 05:27:47,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:47,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1060505169, now seen corresponding path program 1 times [2024-11-10 05:27:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277458361] [2024-11-10 05:27:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:27:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:27:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:27:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:27:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:27:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:27:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:27:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:27:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:27:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 05:27:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:27:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 05:27:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:27:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 05:27:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:27:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:27:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:27:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 05:27:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:47,414 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-10 05:27:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:27:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277458361] [2024-11-10 05:27:47,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277458361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:47,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:47,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932891832] [2024-11-10 05:27:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:47,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:27:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:47,416 INFO L87 Difference]: Start difference. First operand 652 states and 882 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-10 05:27:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:47,717 INFO L93 Difference]: Finished difference Result 1070 states and 1437 transitions. [2024-11-10 05:27:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:47,719 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-10 05:27:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:47,724 INFO L225 Difference]: With dead ends: 1070 [2024-11-10 05:27:47,724 INFO L226 Difference]: Without dead ends: 776 [2024-11-10 05:27:47,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-10 05:27:47,726 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:47,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 185 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:27:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-10 05:27:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 676. [2024-11-10 05:27:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 505 states have (on average 1.2633663366336634) internal successors, (638), 510 states have internal predecessors, (638), 136 states have call successors, (136), 34 states have call predecessors, (136), 34 states have return successors, (136), 131 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 05:27:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 910 transitions. [2024-11-10 05:27:47,814 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 910 transitions. Word has length 133 [2024-11-10 05:27:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:47,818 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 910 transitions. [2024-11-10 05:27:47,819 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-10 05:27:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 910 transitions. [2024-11-10 05:27:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 05:27:47,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:47,820 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-10 05:27:47,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:27:47,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:47,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -736446190, now seen corresponding path program 1 times [2024-11-10 05:27:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:27:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942336335] [2024-11-10 05:27:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:27:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:27:47,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403493192] [2024-11-10 05:27:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:47,874 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-10 05:27:47,881 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-10 05:27:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:27:47,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:27:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:27:48,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:27:48,082 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:27:48,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:27:48,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:27:48,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:27:48,287 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:27:48,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:27:48,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:27:48 BoogieIcfgContainer [2024-11-10 05:27:48,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:27:48,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:27:48,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:27:48,366 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:27:48,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:30" (3/4) ... [2024-11-10 05:27:48,368 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:27:48,368 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:27:48,369 INFO L158 Benchmark]: Toolchain (without parser) took 18528.22ms. Allocated memory was 153.1MB in the beginning and 335.5MB in the end (delta: 182.5MB). Free memory was 81.7MB in the beginning and 138.6MB in the end (delta: -57.0MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,369 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:27:48,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.93ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 81.5MB in the beginning and 201.6MB in the end (delta: -120.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.95ms. Allocated memory is still 230.7MB. Free memory was 201.6MB in the beginning and 196.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,370 INFO L158 Benchmark]: Boogie Preprocessor took 38.57ms. Allocated memory is still 230.7MB. Free memory was 196.3MB in the beginning and 190.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,370 INFO L158 Benchmark]: IcfgBuilder took 468.38ms. Allocated memory is still 230.7MB. Free memory was 190.0MB in the beginning and 162.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,370 INFO L158 Benchmark]: TraceAbstraction took 17606.24ms. Allocated memory was 230.7MB in the beginning and 335.5MB in the end (delta: 104.9MB). Free memory was 162.8MB in the beginning and 139.7MB in the end (delta: 23.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. [2024-11-10 05:27:48,370 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 335.5MB. Free memory was 139.7MB in the beginning and 138.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:27:48,371 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.24ms. Allocated memory is still 153.1MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.93ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 81.5MB in the beginning and 201.6MB in the end (delta: -120.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.95ms. Allocated memory is still 230.7MB. Free memory was 201.6MB in the beginning and 196.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.57ms. Allocated memory is still 230.7MB. Free memory was 196.3MB in the beginning and 190.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 468.38ms. Allocated memory is still 230.7MB. Free memory was 190.0MB in the beginning and 162.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17606.24ms. Allocated memory was 230.7MB in the beginning and 335.5MB in the end (delta: 104.9MB). Free memory was 162.8MB in the beginning and 139.7MB in the end (delta: 23.1MB). Peak memory consumption was 127.9MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 335.5MB. Free memory was 139.7MB in the beginning and 138.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] float var_1_26 = 500.65; [L38] float var_1_30 = 9.8; [L39] unsigned char var_1_31 = 4; [L40] unsigned short int var_1_34 = 1; [L41] unsigned long int var_1_35 = 10; [L42] unsigned char var_1_36 = 10; [L43] unsigned char var_1_38 = 16; [L44] unsigned char var_1_39 = 0; [L45] unsigned short int var_1_40 = 10; [L46] unsigned short int var_1_41 = 128; [L47] unsigned short int var_1_42 = 40597; [L48] signed short int last_1_var_1_1 = 16; [L49] unsigned char last_1_var_1_6 = 10; [L50] unsigned char last_1_var_1_8 = 1; [L51] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L171] last_1_var_1_1 = var_1_1 [L172] last_1_var_1_6 = var_1_6 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L141] var_1_5 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L142] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L143] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L144] var_1_7 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L145] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L146] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L146] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L150] var_1_12 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L155] var_1_16 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L156] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L157] var_1_20 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L159] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L160] var_1_38 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L161] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_39 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_42 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] signed long int stepLocal_6 = last_1_var_1_1; [L56] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L57] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L58] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L61] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L66] COND TRUE (- var_1_15) < ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) [L67] var_1_30 = var_1_15 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L69] COND TRUE \read(var_1_11) [L70] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=10, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L72] COND TRUE \read(var_1_11) [L73] var_1_36 = (var_1_7 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L77] COND FALSE !(var_1_7 <= (~ var_1_6)) [L82] var_1_41 = var_1_6 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND TRUE var_1_5 >= -2 [L88] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=4, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L90] COND TRUE ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_5)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_5))) <= var_1_13 [L91] var_1_31 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L93] COND TRUE (- var_1_6) != var_1_7 [L94] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L96] unsigned char stepLocal_4 = var_1_6; [L97] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L98] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L99] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L100] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L107] COND FALSE !(((var_1_7 + 25) % var_1_7) < 2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L110] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L111] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L114] COND FALSE !(var_1_7 < ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L117] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L118] COND TRUE \read(var_1_19) [L119] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L125] COND TRUE var_1_12 || var_1_19 [L126] var_1_21 = ((var_1_6 > -4) || var_1_11) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L128] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L129] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=1] [L130] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L137] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_15=3, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_26=10013/20, var_1_30=3, var_1_31=201, var_1_34=1, var_1_35=201, var_1_36=201, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=10, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.5s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2538 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2537 mSDsluCounter, 2826 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1991 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2289 IncrementalHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 835 mSDtfsCounter, 2289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 822 GetRequests, 668 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6054 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=7, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 810 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1178 ConstructedInterpolants, 0 QuantifiedInterpolants, 3869 SizeOfPredicates, 12 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 5325/5508 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-10 05:27:48,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.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 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:27:50,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:27:50,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:27:50,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:27:50,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:27:50,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:27:50,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:27:50,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:27:50,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:27:50,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:27:50,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:27:50,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:27:50,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:27:50,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:27:50,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:27:50,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:27:50,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:27:50,865 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:27:50,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:27:50,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:27:50,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:27:50,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:27:50,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:27:50,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:27:50,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:27:50,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:27:50,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:27:50,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:50,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:27:50,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:27:50,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:27:50,868 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:27:50,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:27:50,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:27:50,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:27:50,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:27:50,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:27:50,870 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 -> 63de2d71d444749da4273a6a58c4b105d09e2f11c04911b2ed4cbf82a61c5b48 [2024-11-10 05:27:51,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:27:51,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:27:51,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:27:51,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:27:51,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:27:51,145 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-42.i [2024-11-10 05:27:52,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:27:52,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:27:52,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-10 05:27:52,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d609b770/0483ee44e15b429e85344d7855ebeb0e/FLAGf843d0622 [2024-11-10 05:27:53,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d609b770/0483ee44e15b429e85344d7855ebeb0e [2024-11-10 05:27:53,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:27:53,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:27:53,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:53,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:27:53,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:27:53,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b935fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53, skipping insertion in model container [2024-11-10 05:27:53,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:27:53,452 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-42.i[919,932] [2024-11-10 05:27:53,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:53,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:27:53,546 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-42.i[919,932] [2024-11-10 05:27:53,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:27:53,604 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:27:53,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53 WrapperNode [2024-11-10 05:27:53,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:27:53,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:53,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:27:53,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:27:53,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,658 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-10 05:27:53,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:27:53,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:27:53,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:27:53,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:27:53,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,694 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-10 05:27:53,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:27:53,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:27:53,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:27:53,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:27:53,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (1/1) ... [2024-11-10 05:27:53,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:27:53,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:27:53,752 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-10 05:27:53,757 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-10 05:27:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:27:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:27:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:27:53,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:27:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:27:53,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:27:53,877 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:27:53,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:27:54,362 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 05:27:54,362 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:27:54,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:27:54,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:27:54,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:54 BoogieIcfgContainer [2024-11-10 05:27:54,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:27:54,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:27:54,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:27:54,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:27:54,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:53" (1/3) ... [2024-11-10 05:27:54,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33789bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:54, skipping insertion in model container [2024-11-10 05:27:54,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:53" (2/3) ... [2024-11-10 05:27:54,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33789bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:54, skipping insertion in model container [2024-11-10 05:27:54,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:27:54" (3/3) ... [2024-11-10 05:27:54,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-42.i [2024-11-10 05:27:54,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:27:54,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:27:54,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:27:54,463 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;@62b83c57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:27:54,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:27:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 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-10 05:27:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 05:27:54,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:54,476 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-10 05:27:54,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:54,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1650203955, now seen corresponding path program 1 times [2024-11-10 05:27:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:27:54,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372228515] [2024-11-10 05:27:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:54,492 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-10 05:27:54,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:27:54,495 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-10 05:27:54,496 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-10 05:27:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:54,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:27:54,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-10 05:27:54,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:27:54,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:27:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372228515] [2024-11-10 05:27:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372228515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:27:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782512205] [2024-11-10 05:27:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:54,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:27:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:27:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:27:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:27:55,010 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 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-10 05:27:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:55,040 INFO L93 Difference]: Finished difference Result 141 states and 241 transitions. [2024-11-10 05:27:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:27:55,042 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-10 05:27:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:55,047 INFO L225 Difference]: With dead ends: 141 [2024-11-10 05:27:55,047 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 05:27:55,050 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-10 05:27:55,052 INFO L432 NwaCegarLoop]: 105 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, 105 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-10 05:27:55,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:27:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 05:27:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 05:27:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 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-10 05:27:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2024-11-10 05:27:55,084 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 131 [2024-11-10 05:27:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:55,084 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2024-11-10 05:27:55,085 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-10 05:27:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2024-11-10 05:27:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 05:27:55,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:55,088 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-10 05:27:55,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 05:27:55,291 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-10 05:27:55,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 401102453, now seen corresponding path program 1 times [2024-11-10 05:27:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:27:55,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745580736] [2024-11-10 05:27:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:55,298 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-10 05:27:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:27:55,301 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-10 05:27:55,305 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-10 05:27:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:55,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 05:27:55,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:55,945 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-10 05:27:55,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:27:55,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:27:55,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745580736] [2024-11-10 05:27:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745580736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:55,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:55,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245548876] [2024-11-10 05:27:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:55,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:27:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:27:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:27:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:27:55,949 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-10 05:27:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:56,213 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-10 05:27:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:27:56,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 131 [2024-11-10 05:27:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:56,220 INFO L225 Difference]: With dead ends: 203 [2024-11-10 05:27:56,221 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 05:27:56,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:56,222 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 107 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:56,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 297 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:27:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 05:27:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-10 05:27:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 05:27:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-10 05:27:56,245 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 131 [2024-11-10 05:27:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:56,245 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-10 05:27:56,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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-10 05:27:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-10 05:27:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:56,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:56,247 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-10 05:27:56,259 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-10 05:27:56,452 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-10 05:27:56,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:56,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash -437283088, now seen corresponding path program 1 times [2024-11-10 05:27:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:27:56,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308052176] [2024-11-10 05:27:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:56,454 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-10 05:27:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:27:56,457 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-10 05:27:56,463 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-10 05:27:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:56,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:27:56,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:57,306 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-10 05:27:57,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:27:57,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:27:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308052176] [2024-11-10 05:27:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308052176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:57,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:57,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:27:57,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050042319] [2024-11-10 05:27:57,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:57,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:27:57,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:27:57,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:27:57,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:27:57,311 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:27:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:57,801 INFO L93 Difference]: Finished difference Result 302 states and 468 transitions. [2024-11-10 05:27:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:27:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:27:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:57,813 INFO L225 Difference]: With dead ends: 302 [2024-11-10 05:27:57,814 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 05:27:57,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:27:57,815 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 154 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:57,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 458 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:27:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 05:27:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 168. [2024-11-10 05:27:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 05:27:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2024-11-10 05:27:57,843 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 132 [2024-11-10 05:27:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2024-11-10 05:27:57,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:27:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2024-11-10 05:27:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:57,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:57,845 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-10 05:27:57,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:27:58,049 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-10 05:27:58,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:58,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:58,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1780474865, now seen corresponding path program 1 times [2024-11-10 05:27:58,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:27:58,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111533365] [2024-11-10 05:27:58,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:58,055 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-10 05:27:58,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:27:58,062 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-10 05:27:58,063 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-10 05:27:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:27:58,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:58,318 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-10 05:27:58,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:27:58,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:27:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111533365] [2024-11-10 05:27:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111533365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:27:58,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:27:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:27:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063778014] [2024-11-10 05:27:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:27:58,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:27:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:27:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:27:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:27:58,321 INFO L87 Difference]: Start difference. First operand 168 states and 256 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-10 05:27:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:27:58,398 INFO L93 Difference]: Finished difference Result 297 states and 456 transitions. [2024-11-10 05:27:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:27:58,403 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-10 05:27:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:27:58,405 INFO L225 Difference]: With dead ends: 297 [2024-11-10 05:27:58,405 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 05:27:58,406 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-10 05:27:58,406 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:27:58,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:27:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 05:27:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-10 05:27:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 05:27:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2024-11-10 05:27:58,424 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 132 [2024-11-10 05:27:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:27:58,425 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2024-11-10 05:27:58,425 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-10 05:27:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2024-11-10 05:27:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:27:58,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:27:58,435 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-10 05:27:58,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 05:27:58,636 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-10 05:27:58,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:27:58,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:27:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1909557584, now seen corresponding path program 1 times [2024-11-10 05:27:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:27:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769885266] [2024-11-10 05:27:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:27:58,637 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-10 05:27:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:27:58,640 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-10 05:27:58,641 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-10 05:27:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:27:58,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:27:58,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:27:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 45 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-10 05:27:59,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:27:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 48 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-10 05:27:59,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:27:59,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769885266] [2024-11-10 05:27:59,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769885266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:27:59,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:27:59,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-10 05:27:59,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337291992] [2024-11-10 05:27:59,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:27:59,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 05:27:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:27:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 05:27:59,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:27:59,326 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-10 05:28:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:00,132 INFO L93 Difference]: Finished difference Result 436 states and 628 transitions. [2024-11-10 05:28:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 05:28:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 132 [2024-11-10 05:28:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:00,135 INFO L225 Difference]: With dead ends: 436 [2024-11-10 05:28:00,135 INFO L226 Difference]: Without dead ends: 307 [2024-11-10 05:28:00,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 05:28:00,136 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 417 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:00,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 567 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:28:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-10 05:28:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2024-11-10 05:28:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 195 states have (on average 1.3128205128205128) internal successors, (256), 195 states have internal predecessors, (256), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 05:28:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 400 transitions. [2024-11-10 05:28:00,187 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 400 transitions. Word has length 132 [2024-11-10 05:28:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:00,188 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 400 transitions. [2024-11-10 05:28:00,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-10 05:28:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 400 transitions. [2024-11-10 05:28:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:28:00,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:00,195 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-10 05:28:00,205 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:00,396 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-10 05:28:00,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:00,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1500733359, now seen corresponding path program 1 times [2024-11-10 05:28:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867258438] [2024-11-10 05:28:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:00,402 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-10 05:28:00,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:00,403 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-10 05:28:00,405 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-10 05:28:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:00,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 05:28:00,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-10 05:28:01,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:01,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867258438] [2024-11-10 05:28:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867258438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:01,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [903139197] [2024-11-10 05:28:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:01,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:01,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:28:01,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:28:01,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-10 05:28:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:01,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 05:28:01,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:02,363 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-10 05:28:02,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:28:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [903139197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:28:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-10 05:28:02,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931106405] [2024-11-10 05:28:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:02,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:28:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:28:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:28:02,365 INFO L87 Difference]: Start difference. First operand 280 states and 400 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 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-10 05:28:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:04,474 INFO L93 Difference]: Finished difference Result 877 states and 1245 transitions. [2024-11-10 05:28:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 05:28:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 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-10 05:28:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:04,478 INFO L225 Difference]: With dead ends: 877 [2024-11-10 05:28:04,478 INFO L226 Difference]: Without dead ends: 652 [2024-11-10 05:28:04,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:28:04,479 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 170 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:04,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 474 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 05:28:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-10 05:28:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 555. [2024-11-10 05:28:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 401 states have (on average 1.311720698254364) internal successors, (526), 403 states have internal predecessors, (526), 130 states have call successors, (130), 23 states have call predecessors, (130), 23 states have return successors, (130), 128 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-10 05:28:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 786 transitions. [2024-11-10 05:28:04,566 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 786 transitions. Word has length 132 [2024-11-10 05:28:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:04,567 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 786 transitions. [2024-11-10 05:28:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 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-10 05:28:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 786 transitions. [2024-11-10 05:28:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:28:04,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:04,569 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-10 05:28:04,581 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 (7)] Ended with exit code 0 [2024-11-10 05:28:04,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-10 05:28:04,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:04,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 656261488, now seen corresponding path program 1 times [2024-11-10 05:28:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191749082] [2024-11-10 05:28:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:04,976 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-10 05:28:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:04,987 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10 05:28:04,989 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 (9)] Waiting until timeout for monitored process [2024-11-10 05:28:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:05,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 05:28:05,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2024-11-10 05:28:05,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:05,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191749082] [2024-11-10 05:28:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191749082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1852388211] [2024-11-10 05:28:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:05,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:05,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:28:05,942 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:28:05,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-10 05:28:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:06,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 05:28:06,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:07,089 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-10 05:28:07,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:28:07,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1852388211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:07,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:28:07,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 05:28:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177970059] [2024-11-10 05:28:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:07,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:28:07,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:28:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:28:07,091 INFO L87 Difference]: Start difference. First operand 555 states and 786 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:28:08,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:08,619 INFO L93 Difference]: Finished difference Result 1171 states and 1659 transitions. [2024-11-10 05:28:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:28:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:28:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:08,624 INFO L225 Difference]: With dead ends: 1171 [2024-11-10 05:28:08,624 INFO L226 Difference]: Without dead ends: 752 [2024-11-10 05:28:08,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:28:08,626 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 97 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:08,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 413 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 05:28:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-10 05:28:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 696. [2024-11-10 05:28:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 500 states have (on average 1.304) internal successors, (652), 502 states have internal predecessors, (652), 166 states have call successors, (166), 29 states have call predecessors, (166), 29 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2024-11-10 05:28:08,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 984 transitions. [2024-11-10 05:28:08,689 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 984 transitions. Word has length 132 [2024-11-10 05:28:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:08,690 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 984 transitions. [2024-11-10 05:28:08,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 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-10 05:28:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 984 transitions. [2024-11-10 05:28:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 05:28:08,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:08,695 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-10 05:28:08,706 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 (9)] Ended with exit code 0 [2024-11-10 05:28:08,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-10 05:28:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:28:09,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1060505169, now seen corresponding path program 1 times [2024-11-10 05:28:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592318481] [2024-11-10 05:28:09,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:09,102 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-10 05:28:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:09,104 INFO L229 MonitoredProcess]: Starting monitored process 11 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-10 05:28:09,105 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 (11)] Waiting until timeout for monitored process [2024-11-10 05:28:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:09,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:28:09,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:28:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 158 proven. 84 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-10 05:28:09,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:28:09,730 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-10 05:28:09,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:28:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592318481] [2024-11-10 05:28:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592318481] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:28:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:28:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-10 05:28:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135108046] [2024-11-10 05:28:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:28:09,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:28:09,732 INFO L87 Difference]: Start difference. First operand 696 states and 984 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-10 05:28:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:10,070 INFO L93 Difference]: Finished difference Result 1134 states and 1577 transitions. [2024-11-10 05:28:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:10,071 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-10 05:28:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:10,076 INFO L225 Difference]: With dead ends: 1134 [2024-11-10 05:28:10,076 INFO L226 Difference]: Without dead ends: 917 [2024-11-10 05:28:10,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:28:10,078 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 31 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:10,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 185 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:28:10,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-10 05:28:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 828. [2024-11-10 05:28:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 614 states have (on average 1.294788273615635) internal successors, (795), 622 states have internal predecessors, (795), 178 states have call successors, (178), 35 states have call predecessors, (178), 35 states have return successors, (178), 170 states have call predecessors, (178), 178 states have call successors, (178) [2024-11-10 05:28:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1151 transitions. [2024-11-10 05:28:10,138 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1151 transitions. Word has length 133 [2024-11-10 05:28:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1151 transitions. [2024-11-10 05:28:10,139 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-10 05:28:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1151 transitions. [2024-11-10 05:28:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-10 05:28:10,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:10,140 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-10 05:28:10,149 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 (11)] Forceful destruction successful, exit code 0 [2024-11-10 05:28:10,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-10 05:28:10,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:10,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -736446190, now seen corresponding path program 1 times [2024-11-10 05:28:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:28:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468404049] [2024-11-10 05:28:10,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:10,346 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-10 05:28:10,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:28:10,349 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10 05:28:10,349 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 (12)] Waiting until timeout for monitored process [2024-11-10 05:28:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:10,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 05:28:10,541 INFO L278 TraceCheckSpWp]: Computing forward predicates...