./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:53:16,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:53:16,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:53:16,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:53:16,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:53:16,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:53:16,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:53:16,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:53:16,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:53:16,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:53:16,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:53:16,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:53:16,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:53:16,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:53:16,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:53:16,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:53:16,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:53:16,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:53:16,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:53:16,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:53:16,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:53:16,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:53:16,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:53:16,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:53:16,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:53:16,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:53:16,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:53:16,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:53:16,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:53:16,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:53:16,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:16,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:53:16,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:53:16,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:53:16,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:53:16,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:53:16,385 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-10 04:53:16,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:53:16,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:53:16,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:53:16,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:53:16,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:53:16,621 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-pe-ci_file-27.i [2024-11-10 04:53:18,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:53:18,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:53:18,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-10 04:53:18,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654ced4db/071e9ed80e954c5390ef134d370f3271/FLAGa105fe649 [2024-11-10 04:53:18,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654ced4db/071e9ed80e954c5390ef134d370f3271 [2024-11-10 04:53:18,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:53:18,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:53:18,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:18,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:53:18,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:53:18,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fdf79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18, skipping insertion in model container [2024-11-10 04:53:18,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,274 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:53:18,401 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-pe-ci_file-27.i[919,932] [2024-11-10 04:53:18,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:18,499 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:53:18,508 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-pe-ci_file-27.i[919,932] [2024-11-10 04:53:18,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:18,585 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:53:18,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18 WrapperNode [2024-11-10 04:53:18,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:18,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:18,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:53:18,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:53:18,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,693 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-10 04:53:18,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:18,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:53:18,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:53:18,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:53:18,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,727 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 04:53:18,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:53:18,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:53:18,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:53:18,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:53:18,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (1/1) ... [2024-11-10 04:53:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:18,806 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 04:53:18,808 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 04:53:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:53:18,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:53:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:53:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:53:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:53:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:53:18,913 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:53:18,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:53:19,235 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-10 04:53:19,271 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:53:19,272 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:53:19,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:53:19,296 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 04:53:19,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:19 BoogieIcfgContainer [2024-11-10 04:53:19,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:53:19,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:53:19,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:53:19,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:53:19,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:53:18" (1/3) ... [2024-11-10 04:53:19,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18287b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:19, skipping insertion in model container [2024-11-10 04:53:19,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:18" (2/3) ... [2024-11-10 04:53:19,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18287b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:19, skipping insertion in model container [2024-11-10 04:53:19,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:19" (3/3) ... [2024-11-10 04:53:19,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-10 04:53:19,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:53:19,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:53:19,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:53:19,384 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;@24e22fe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:53:19,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:53:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:53:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:53:19,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:19,400 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:19,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:19,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash -127502355, now seen corresponding path program 1 times [2024-11-10 04:53:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064134525] [2024-11-10 04:53:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:19,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064134525] [2024-11-10 04:53:19,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064134525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:19,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:19,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:53:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321613769] [2024-11-10 04:53:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:53:19,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:53:19,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:53:19,914 INFO L87 Difference]: Start difference. First operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:53:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:19,946 INFO L93 Difference]: Finished difference Result 180 states and 309 transitions. [2024-11-10 04:53:19,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:53:19,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-10 04:53:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:19,957 INFO L225 Difference]: With dead ends: 180 [2024-11-10 04:53:19,958 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 04:53:19,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:53:19,969 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:19,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:53:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 04:53:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 04:53:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:53:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-11-10 04:53:20,013 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 174 [2024-11-10 04:53:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:20,014 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-11-10 04:53:20,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:53:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-11-10 04:53:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:53:20,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:20,039 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:20,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:53:20,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:20,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 979948775, now seen corresponding path program 1 times [2024-11-10 04:53:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876117984] [2024-11-10 04:53:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:20,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876117984] [2024-11-10 04:53:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876117984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:20,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:53:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536617610] [2024-11-10 04:53:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:20,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:53:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:53:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:53:20,645 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:20,758 INFO L93 Difference]: Finished difference Result 261 states and 399 transitions. [2024-11-10 04:53:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:53:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-10 04:53:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:20,764 INFO L225 Difference]: With dead ends: 261 [2024-11-10 04:53:20,764 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 04:53:20,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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 04:53:20,768 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 79 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:20,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 449 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:53:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 04:53:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-11-10 04:53:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 115 states have internal predecessors, (155), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:53:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2024-11-10 04:53:20,814 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 174 [2024-11-10 04:53:20,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:20,816 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2024-11-10 04:53:20,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2024-11-10 04:53:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:53:20,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:20,819 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:53:20,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:20,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1461882871, now seen corresponding path program 1 times [2024-11-10 04:53:20,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:20,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905190338] [2024-11-10 04:53:20,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905190338] [2024-11-10 04:53:21,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905190338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:21,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 04:53:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149856722] [2024-11-10 04:53:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:21,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 04:53:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 04:53:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:53:21,417 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:21,760 INFO L93 Difference]: Finished difference Result 450 states and 681 transitions. [2024-11-10 04:53:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 04:53:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-10 04:53:21,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:21,764 INFO L225 Difference]: With dead ends: 450 [2024-11-10 04:53:21,764 INFO L226 Difference]: Without dead ends: 283 [2024-11-10 04:53:21,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:53:21,767 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 135 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:21,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 530 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:53:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-10 04:53:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-11-10 04:53:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 205 states have (on average 1.3707317073170733) internal successors, (281), 207 states have internal predecessors, (281), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-10 04:53:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 417 transitions. [2024-11-10 04:53:21,805 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 417 transitions. Word has length 175 [2024-11-10 04:53:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:21,808 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 417 transitions. [2024-11-10 04:53:21,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 417 transitions. [2024-11-10 04:53:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 04:53:21,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:21,810 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:53:21,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:21,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:21,811 INFO L85 PathProgramCache]: Analyzing trace with hash -615326472, now seen corresponding path program 1 times [2024-11-10 04:53:21,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91689536] [2024-11-10 04:53:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91689536] [2024-11-10 04:53:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91689536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:53:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596045251] [2024-11-10 04:53:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:22,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:53:22,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:22,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:53:22,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:53:22,152 INFO L87 Difference]: Start difference. First operand 278 states and 417 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:22,394 INFO L93 Difference]: Finished difference Result 827 states and 1243 transitions. [2024-11-10 04:53:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:53:22,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-10 04:53:22,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:22,401 INFO L225 Difference]: With dead ends: 827 [2024-11-10 04:53:22,402 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 04:53:22,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:53:22,403 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 202 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:22,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 341 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:53:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 04:53:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 544. [2024-11-10 04:53:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 399 states have (on average 1.3709273182957393) internal successors, (547), 403 states have internal predecessors, (547), 136 states have call successors, (136), 8 states have call predecessors, (136), 8 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 04:53:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 819 transitions. [2024-11-10 04:53:22,446 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 819 transitions. Word has length 175 [2024-11-10 04:53:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 819 transitions. [2024-11-10 04:53:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 819 transitions. [2024-11-10 04:53:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:53:22,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:22,448 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:53:22,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:22,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash -747184535, now seen corresponding path program 1 times [2024-11-10 04:53:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:22,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926552071] [2024-11-10 04:53:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:53:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926552071] [2024-11-10 04:53:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926552071] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:22,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230009215] [2024-11-10 04:53:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:22,714 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 04:53:22,716 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 04:53:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:22,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:53:22,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 633 proven. 27 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-10 04:53:23,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:53:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230009215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:53:23,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:53:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 04:53:23,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821754896] [2024-11-10 04:53:23,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:23,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:53:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:53:23,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:53:23,193 INFO L87 Difference]: Start difference. First operand 544 states and 819 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 04:53:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:23,392 INFO L93 Difference]: Finished difference Result 1117 states and 1663 transitions. [2024-11-10 04:53:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 04:53:23,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 176 [2024-11-10 04:53:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:23,400 INFO L225 Difference]: With dead ends: 1117 [2024-11-10 04:53:23,400 INFO L226 Difference]: Without dead ends: 576 [2024-11-10 04:53:23,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:53:23,403 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 133 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:23,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 243 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:53:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-11-10 04:53:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2024-11-10 04:53:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 411 states have (on average 1.340632603406326) internal successors, (551), 415 states have internal predecessors, (551), 136 states have call successors, (136), 12 states have call predecessors, (136), 12 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 04:53:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 823 transitions. [2024-11-10 04:53:23,457 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 823 transitions. Word has length 176 [2024-11-10 04:53:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:23,458 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 823 transitions. [2024-11-10 04:53:23,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 04:53:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 823 transitions. [2024-11-10 04:53:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:53:23,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:23,460 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:23,480 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 04:53:23,661 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 04:53:23,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash 82962762, now seen corresponding path program 1 times [2024-11-10 04:53:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:23,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481249732] [2024-11-10 04:53:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:23,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:53:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:53:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:53:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:53:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:53:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 04:53:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 04:53:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 04:53:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 04:53:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 04:53:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 04:53:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 04:53:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 04:53:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 04:53:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 04:53:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 04:53:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 04:53:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:53:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:53:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:53:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:53:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:53:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:53:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:53:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:53:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 04:53:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 90 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-11-10 04:53:24,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:24,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481249732] [2024-11-10 04:53:24,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481249732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468332059] [2024-11-10 04:53:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:24,312 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 04:53:24,314 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 04:53:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:24,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 04:53:24,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-10 04:53:24,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-10 04:53:25,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468332059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:53:25,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:53:25,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 23 [2024-11-10 04:53:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560175667] [2024-11-10 04:53:25,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:25,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 04:53:25,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 04:53:25,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:53:25,438 INFO L87 Difference]: Start difference. First operand 560 states and 823 transitions. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-10 04:53:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:26,714 INFO L93 Difference]: Finished difference Result 1269 states and 1808 transitions. [2024-11-10 04:53:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 04:53:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 176 [2024-11-10 04:53:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:26,720 INFO L225 Difference]: With dead ends: 1269 [2024-11-10 04:53:26,721 INFO L226 Difference]: Without dead ends: 985 [2024-11-10 04:53:26,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 393 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1912, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 04:53:26,724 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 706 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:26,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1014 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:53:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-10 04:53:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 777. [2024-11-10 04:53:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 564 states have (on average 1.301418439716312) internal successors, (734), 570 states have internal predecessors, (734), 182 states have call successors, (182), 30 states have call predecessors, (182), 30 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-10 04:53:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1098 transitions. [2024-11-10 04:53:26,798 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1098 transitions. Word has length 176 [2024-11-10 04:53:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:26,798 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1098 transitions. [2024-11-10 04:53:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-10 04:53:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1098 transitions. [2024-11-10 04:53:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:53:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:26,801 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:26,817 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 04:53:27,002 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 04:53:27,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash -753212819, now seen corresponding path program 1 times [2024-11-10 04:53:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848405051] [2024-11-10 04:53:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:53:27,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597211072] [2024-11-10 04:53:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:27,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:27,085 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 04:53:27,086 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 04:53:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:27,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 04:53:27,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 333 proven. 9 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2024-11-10 04:53:27,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:53:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848405051] [2024-11-10 04:53:27,700 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:53:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597211072] [2024-11-10 04:53:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597211072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:53:27,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:53:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 04:53:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995492015] [2024-11-10 04:53:27,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:27,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 04:53:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 04:53:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:53:27,703 INFO L87 Difference]: Start difference. First operand 777 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-10 04:53:28,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:28,859 INFO L93 Difference]: Finished difference Result 2067 states and 2875 transitions. [2024-11-10 04:53:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 04:53:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 176 [2024-11-10 04:53:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:28,871 INFO L225 Difference]: With dead ends: 2067 [2024-11-10 04:53:28,872 INFO L226 Difference]: Without dead ends: 1315 [2024-11-10 04:53:28,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2024-11-10 04:53:28,876 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 275 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:28,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 446 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 04:53:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-10 04:53:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1053. [2024-11-10 04:53:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 789 states have (on average 1.296577946768061) internal successors, (1023), 800 states have internal predecessors, (1023), 222 states have call successors, (222), 41 states have call predecessors, (222), 41 states have return successors, (222), 211 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-10 04:53:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1467 transitions. [2024-11-10 04:53:28,967 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1467 transitions. Word has length 176 [2024-11-10 04:53:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:28,968 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1467 transitions. [2024-11-10 04:53:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-10 04:53:28,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1467 transitions. [2024-11-10 04:53:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:53:28,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:28,971 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:28,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 04:53:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:29,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:29,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -114675621, now seen corresponding path program 1 times [2024-11-10 04:53:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828875897] [2024-11-10 04:53:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:53:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1476635727] [2024-11-10 04:53:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:29,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:53:29,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 04:53:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:29,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 04:53:29,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-10 04:53:29,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:30,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:53:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828875897] [2024-11-10 04:53:30,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 04:53:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476635727] [2024-11-10 04:53:30,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476635727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:30,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:53:30,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 04:53:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846622383] [2024-11-10 04:53:30,895 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 04:53:30,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 04:53:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:53:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 04:53:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=214, Unknown=5, NotChecked=0, Total=306 [2024-11-10 04:53:30,896 INFO L87 Difference]: Start difference. First operand 1053 states and 1467 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 04:53:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:31,967 INFO L93 Difference]: Finished difference Result 2320 states and 3159 transitions. [2024-11-10 04:53:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 04:53:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 176 [2024-11-10 04:53:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:31,978 INFO L225 Difference]: With dead ends: 2320 [2024-11-10 04:53:31,978 INFO L226 Difference]: Without dead ends: 1296 [2024-11-10 04:53:31,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=673, Unknown=5, NotChecked=0, Total=992 [2024-11-10 04:53:31,983 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 301 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:31,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 680 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:53:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-10 04:53:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 963. [2024-11-10 04:53:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 733 states have (on average 1.290586630286494) internal successors, (946), 739 states have internal predecessors, (946), 182 states have call successors, (182), 47 states have call predecessors, (182), 47 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2024-11-10 04:53:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1310 transitions. [2024-11-10 04:53:32,073 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1310 transitions. Word has length 176 [2024-11-10 04:53:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:32,074 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1310 transitions. [2024-11-10 04:53:32,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 04:53:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1310 transitions. [2024-11-10 04:53:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:53:32,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:32,076 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:32,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 04:53:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:32,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 831102545, now seen corresponding path program 1 times [2024-11-10 04:53:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:53:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255806891] [2024-11-10 04:53:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:53:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:53:32,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137085727] [2024-11-10 04:53:32,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:32,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:53:32,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 04:53:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:53:32,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:53:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:53:32,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:53:32,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:53:32,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:53:32,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 04:53:32,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:53:32,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:33,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:53:33,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:53:33 BoogieIcfgContainer [2024-11-10 04:53:33,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:53:33,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:53:33,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:53:33,052 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:53:33,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:19" (3/4) ... [2024-11-10 04:53:33,054 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:53:33,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:53:33,056 INFO L158 Benchmark]: Toolchain (without parser) took 14816.60ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 91.8MB in the beginning and 281.2MB in the end (delta: -189.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:53:33,056 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:53:33,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.76ms. Allocated memory is still 161.5MB. Free memory was 91.5MB in the beginning and 131.7MB in the end (delta: -40.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-10 04:53:33,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.43ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 127.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:53:33,056 INFO L158 Benchmark]: Boogie Preprocessor took 65.54ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:53:33,057 INFO L158 Benchmark]: IcfgBuilder took 532.41ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 97.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:53:33,057 INFO L158 Benchmark]: TraceAbstraction took 13751.28ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 97.0MB in the beginning and 281.2MB in the end (delta: -184.2MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. [2024-11-10 04:53:33,057 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 337.6MB. Free memory is still 281.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:53:33,058 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.16ms. Allocated memory is still 115.3MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.76ms. Allocated memory is still 161.5MB. Free memory was 91.5MB in the beginning and 131.7MB in the end (delta: -40.2MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.43ms. Allocated memory is still 161.5MB. Free memory was 131.7MB in the beginning and 127.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.54ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 124.3MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 532.41ms. Allocated memory is still 161.5MB. Free memory was 124.3MB in the beginning and 97.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13751.28ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 97.0MB in the beginning and 281.2MB in the end (delta: -184.2MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 337.6MB. Free memory is still 281.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=0, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_20 = var_1_11 [L59] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L60] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L60] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L61] COND TRUE var_1_12 != var_1_21 [L62] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L67] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L78] unsigned char stepLocal_1 = var_1_14; [L79] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L80] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L81] COND TRUE stepLocal_1 || var_1_14 [L82] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L89] COND FALSE !(var_1_6 > (- var_1_7)) [L94] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L96] var_1_22 = var_1_8 [L97] var_1_23 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L98] COND FALSE !(var_1_11 < var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L103] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L104] COND TRUE var_1_11 >= var_1_11 [L105] var_1_31 = ((((var_1_11) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_11) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L107] COND TRUE var_1_20 < (~ (var_1_11 / var_1_33)) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L108] COND TRUE \read(var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=1, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L109] COND TRUE (var_1_13 * var_1_6) == var_1_5 [L110] var_1_32 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L122] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=0] [L127] COND TRUE ((((var_1_11) < (var_1_33)) ? (var_1_11) : (var_1_33))) < (var_1_39 + var_1_12) [L128] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=0, var_1_8=0] [L130] var_1_47 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=8589934592, var_1_12=8589934592, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8589934592, var_1_21=8, var_1_22=0, var_1_23=0, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=8589934592, var_1_32=0, var_1_33=2, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=8589934592, var_1_47=8589934592, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1931 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1831 mSDsluCounter, 3836 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2665 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2602 IncrementalHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 1171 mSDtfsCounter, 2602 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1585 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=7, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 837 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2460 NumberOfCodeBlocks, 2460 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 6734 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1604 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 16468/16900 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 04:53:33,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.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 f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:53:35,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:53:35,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:53:35,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:53:35,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:53:35,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:53:35,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:53:35,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:53:35,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:53:35,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:53:35,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:53:35,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:53:35,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:53:35,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:53:35,128 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:53:35,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:53:35,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:53:35,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:53:35,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:53:35,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:53:35,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:53:35,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:53:35,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:53:35,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:53:35,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:53:35,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:53:35,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:53:35,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:53:35,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:53:35,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:53:35,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:53:35,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:53:35,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:53:35,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:53:35,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:35,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:53:35,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:53:35,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:53:35,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:53:35,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:53:35,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:53:35,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:53:35,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:53:35,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:53:35,141 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 -> f14202f951fe89438d327807ffbecb479f5f15295ecb3a059a45561896451f31 [2024-11-10 04:53:35,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:53:35,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:53:35,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:53:35,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:53:35,447 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:53:35,449 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-pe-ci_file-27.i [2024-11-10 04:53:36,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:53:37,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:53:37,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-10 04:53:37,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9aed13c/5e882b63980248048f6b10e46db8b2a5/FLAG3d1b41d39 [2024-11-10 04:53:37,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9aed13c/5e882b63980248048f6b10e46db8b2a5 [2024-11-10 04:53:37,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:53:37,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:53:37,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:37,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:53:37,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:53:37,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7c5da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37, skipping insertion in model container [2024-11-10 04:53:37,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:53:37,363 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-pe-ci_file-27.i[919,932] [2024-11-10 04:53:37,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:37,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:53:37,465 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-pe-ci_file-27.i[919,932] [2024-11-10 04:53:37,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:53:37,535 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:53:37,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37 WrapperNode [2024-11-10 04:53:37,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:53:37,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:37,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:53:37,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:53:37,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,603 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-10 04:53:37,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:53:37,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:53:37,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:53:37,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:53:37,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,635 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 04:53:37,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:53:37,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:53:37,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:53:37,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:53:37,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (1/1) ... [2024-11-10 04:53:37,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:53:37,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:53:37,691 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 04:53:37,696 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 04:53:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:53:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:53:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:53:37,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:53:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:53:37,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:53:37,811 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:53:37,813 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:53:45,520 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 04:53:45,520 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:53:45,534 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:53:45,535 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:53:45,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:45 BoogieIcfgContainer [2024-11-10 04:53:45,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:53:45,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:53:45,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:53:45,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:53:45,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:53:37" (1/3) ... [2024-11-10 04:53:45,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3b8bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:45, skipping insertion in model container [2024-11-10 04:53:45,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:53:37" (2/3) ... [2024-11-10 04:53:45,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3b8bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:53:45, skipping insertion in model container [2024-11-10 04:53:45,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:53:45" (3/3) ... [2024-11-10 04:53:45,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-27.i [2024-11-10 04:53:45,561 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:53:45,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:53:45,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:53:45,632 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;@20cb8020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:53:45,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:53:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:53:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 04:53:45,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:45,652 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:45,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1073377167, now seen corresponding path program 1 times [2024-11-10 04:53:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:53:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285399087] [2024-11-10 04:53:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:45,678 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 04:53:45,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:53:45,681 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 04:53:45,682 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 04:53:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:46,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:53:46,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 04:53:46,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:53:46,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:53:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285399087] [2024-11-10 04:53:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285399087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:53:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551003917] [2024-11-10 04:53:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:53:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:53:46,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:53:46,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:53:46,230 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:53:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:46,257 INFO L93 Difference]: Finished difference Result 166 states and 289 transitions. [2024-11-10 04:53:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:53:46,259 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-10 04:53:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:46,265 INFO L225 Difference]: With dead ends: 166 [2024-11-10 04:53:46,265 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 04:53:46,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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 04:53:46,270 INFO L432 NwaCegarLoop]: 124 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, 124 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 04:53:46,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:53:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 04:53:46,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 04:53:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:53:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-10 04:53:46,318 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 171 [2024-11-10 04:53:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-10 04:53:46,319 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:53:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-10 04:53:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 04:53:46,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:46,321 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:46,336 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 04:53:46,522 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 04:53:46,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash 85705941, now seen corresponding path program 1 times [2024-11-10 04:53:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:53:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893935129] [2024-11-10 04:53:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:46,525 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 04:53:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:53:46,529 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 04:53:46,532 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 04:53:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:47,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:53:47,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-10 04:53:48,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:53:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:48,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:53:48,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893935129] [2024-11-10 04:53:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893935129] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 04:53:48,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 04:53:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-10 04:53:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025453396] [2024-11-10 04:53:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:48,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:53:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:53:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:53:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:53:48,667 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:52,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:53:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:52,018 INFO L93 Difference]: Finished difference Result 165 states and 248 transitions. [2024-11-10 04:53:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:53:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-10 04:53:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:52,053 INFO L225 Difference]: With dead ends: 165 [2024-11-10 04:53:52,053 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 04:53:52,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:53:52,055 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 74 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:52,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 150 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 04:53:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 04:53:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 04:53:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:53:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-10 04:53:52,071 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 171 [2024-11-10 04:53:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:52,071 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-10 04:53:52,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-10 04:53:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 04:53:52,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:52,076 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:52,093 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 04:53:52,277 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 04:53:52,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:52,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1020599346, now seen corresponding path program 1 times [2024-11-10 04:53:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:53:52,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494604318] [2024-11-10 04:53:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:52,279 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 04:53:52,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:53:52,281 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 04:53:52,282 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 04:53:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:52,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:53:52,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:53:53,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:53:53,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:53:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494604318] [2024-11-10 04:53:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494604318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:53:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:53:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:53:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754700650] [2024-11-10 04:53:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:53:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:53:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:53:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:53:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:53:53,997 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:55,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:53:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:53:55,649 INFO L93 Difference]: Finished difference Result 252 states and 372 transitions. [2024-11-10 04:53:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:53:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-10 04:53:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:53:55,683 INFO L225 Difference]: With dead ends: 252 [2024-11-10 04:53:55,683 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 04:53:55,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 170 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 04:53:55,684 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 37 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:53:55,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 04:53:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 04:53:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2024-11-10 04:53:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 04:53:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2024-11-10 04:53:55,720 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 172 [2024-11-10 04:53:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:53:55,720 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2024-11-10 04:53:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:53:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2024-11-10 04:53:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:53:55,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:53:55,723 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:53:55,737 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 04:53:55,923 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 04:53:55,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:53:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:53:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1014189111, now seen corresponding path program 1 times [2024-11-10 04:53:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:53:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899479746] [2024-11-10 04:53:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:53:55,925 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 04:53:55,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:53:55,933 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 04:53:55,933 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 04:53:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:53:56,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 04:53:56,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:53:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 788 proven. 90 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2024-11-10 04:53:58,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:54:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 117 proven. 99 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2024-11-10 04:54:00,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:54:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899479746] [2024-11-10 04:54:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899479746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:54:00,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:54:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2024-11-10 04:54:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459565438] [2024-11-10 04:54:00,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:54:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 04:54:00,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:54:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 04:54:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-10 04:54:00,903 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 04:54:08,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:54:09,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:54:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:12,523 INFO L93 Difference]: Finished difference Result 501 states and 701 transitions. [2024-11-10 04:54:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 04:54:12,523 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 173 [2024-11-10 04:54:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:12,526 INFO L225 Difference]: With dead ends: 501 [2024-11-10 04:54:12,526 INFO L226 Difference]: Without dead ends: 340 [2024-11-10 04:54:12,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=589, Invalid=1573, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 04:54:12,528 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 521 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 294 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:12,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 498 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 573 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2024-11-10 04:54:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-10 04:54:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 304. [2024-11-10 04:54:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 198 states have internal predecessors, (237), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 04:54:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2024-11-10 04:54:12,555 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 173 [2024-11-10 04:54:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:12,556 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2024-11-10 04:54:12,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 4 states have call successors, (39), 4 states have call predecessors, (39), 10 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 04:54:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2024-11-10 04:54:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:54:12,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:12,558 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:12,573 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 04:54:12,758 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 04:54:12,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:12,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1318093115, now seen corresponding path program 1 times [2024-11-10 04:54:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449796362] [2024-11-10 04:54:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:12,760 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 04:54:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:12,763 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 04:54:12,764 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 04:54:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:13,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 04:54:13,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-10 04:54:14,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:54:15,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:54:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449796362] [2024-11-10 04:54:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449796362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:54:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2045667055] [2024-11-10 04:54:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 04:54:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 04:54:15,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 04:54:15,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 04:54:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:16,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:54:16,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-11-10 04:54:17,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:54:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2045667055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:54:18,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:54:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-10 04:54:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923770617] [2024-11-10 04:54:18,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:54:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:54:18,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:54:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:54:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 04:54:18,189 INFO L87 Difference]: Start difference. First operand 304 states and 417 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 04:54:23,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:54:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:23,385 INFO L93 Difference]: Finished difference Result 632 states and 837 transitions. [2024-11-10 04:54:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 04:54:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 173 [2024-11-10 04:54:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:23,423 INFO L225 Difference]: With dead ends: 632 [2024-11-10 04:54:23,423 INFO L226 Difference]: Without dead ends: 357 [2024-11-10 04:54:23,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-10 04:54:23,425 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:23,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 190 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-10 04:54:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-10 04:54:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 329. [2024-11-10 04:54:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 215 states have (on average 1.158139534883721) internal successors, (249), 216 states have internal predecessors, (249), 90 states have call successors, (90), 23 states have call predecessors, (90), 23 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-10 04:54:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 429 transitions. [2024-11-10 04:54:23,467 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 429 transitions. Word has length 173 [2024-11-10 04:54:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:23,468 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 429 transitions. [2024-11-10 04:54:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 04:54:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 429 transitions. [2024-11-10 04:54:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 04:54:23,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:23,470 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:23,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-10 04:54:23,686 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 04:54:23,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 04:54:23,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:23,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1715925110, now seen corresponding path program 1 times [2024-11-10 04:54:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081607024] [2024-11-10 04:54:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:23,873 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 04:54:23,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:23,875 INFO L229 MonitoredProcess]: Starting monitored process 8 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 04:54:23,876 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 (8)] Waiting until timeout for monitored process [2024-11-10 04:54:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 04:54:24,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:45,843 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)