./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.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_operatoramount_amount100_file-34.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 a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:07:26,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:07:26,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:07:26,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:07:26,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:07:26,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:07:26,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:07:26,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:07:26,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:07:26,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:07:26,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:07:26,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:07:26,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:07:26,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:07:26,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:07:26,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:07:26,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:07:26,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:07:26,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:07:26,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:07:26,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:07:26,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:07:26,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:07:26,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:07:26,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:07:26,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:07:26,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:07:26,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:07:26,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:07:26,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:07:26,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:07:26,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:07:26,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:07:26,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:07:26,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:07:26,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:07:26,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:07:26,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:07:26,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:07:26,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:07:26,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:07:26,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:07:26,349 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 -> a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 [2024-11-10 08:07:26,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:07:26,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:07:26,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:07:26,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:07:26,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:07:26,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-10 08:07:28,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:07:28,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:07:28,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-10 08:07:28,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8987ec5/07162bb7d3db4a37a19bc955eb887897/FLAG02c419f20 [2024-11-10 08:07:28,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8987ec5/07162bb7d3db4a37a19bc955eb887897 [2024-11-10 08:07:28,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:07:28,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:07:28,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:07:28,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:07:28,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:07:28,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639bc6bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28, skipping insertion in model container [2024-11-10 08:07:28,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:07:28,600 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_operatoramount_amount100_file-34.i[916,929] [2024-11-10 08:07:28,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:07:28,709 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:07:28,724 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_operatoramount_amount100_file-34.i[916,929] [2024-11-10 08:07:28,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:07:28,788 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:07:28,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28 WrapperNode [2024-11-10 08:07:28,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:07:28,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:07:28,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:07:28,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:07:28,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,844 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-10 08:07:28,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:07:28,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:07:28,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:07:28,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:07:28,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,877 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 08:07:28,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:07:28,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:07:28,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:07:28,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:07:28,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (1/1) ... [2024-11-10 08:07:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:07:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:07:28,936 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 08:07:28,941 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 08:07:28,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:07:28,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:07:28,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:07:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:07:28,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:07:28,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:07:29,100 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:07:29,102 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:07:29,523 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 08:07:29,523 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:07:29,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:07:29,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:07:29,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:07:29 BoogieIcfgContainer [2024-11-10 08:07:29,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:07:29,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:07:29,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:07:29,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:07:29,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:07:28" (1/3) ... [2024-11-10 08:07:29,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599d10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:07:29, skipping insertion in model container [2024-11-10 08:07:29,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:28" (2/3) ... [2024-11-10 08:07:29,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5599d10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:07:29, skipping insertion in model container [2024-11-10 08:07:29,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:07:29" (3/3) ... [2024-11-10 08:07:29,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-34.i [2024-11-10 08:07:29,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:07:29,580 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:07:29,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:07:29,651 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;@5be64e0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:07:29,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:07:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 08:07:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:07:29,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:29,676 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:29,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-10 08:07:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910337111] [2024-11-10 08:07:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 08:07:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910337111] [2024-11-10 08:07:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910337111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:07:30,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:07:30,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:07:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091545445] [2024-11-10 08:07:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:07:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:07:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:07:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:07:30,235 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 08:07:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:30,266 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-10 08:07:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:07:30,269 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-10 08:07:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:30,279 INFO L225 Difference]: With dead ends: 158 [2024-11-10 08:07:30,279 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 08:07:30,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 08:07:30,286 INFO L432 NwaCegarLoop]: 118 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, 118 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 08:07:30,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:07:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 08:07:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 08:07:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 08:07:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 08:07:30,343 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-10 08:07:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:30,344 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 08:07:30,345 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 08:07:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 08:07:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:07:30,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:30,353 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:30,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:07:30,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:30,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-10 08:07:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387043278] [2024-11-10 08:07:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 08:07:31,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:31,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387043278] [2024-11-10 08:07:31,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387043278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:07:31,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:07:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:07:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311998183] [2024-11-10 08:07:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:07:31,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:07:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:07:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:07:31,912 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:32,573 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2024-11-10 08:07:32,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:07:32,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-10 08:07:32,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:32,581 INFO L225 Difference]: With dead ends: 355 [2024-11-10 08:07:32,581 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 08:07:32,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:07:32,585 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 396 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:32,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 554 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:07:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 08:07:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 199. [2024-11-10 08:07:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 143 states have internal predecessors, (194), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:07:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2024-11-10 08:07:32,634 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 144 [2024-11-10 08:07:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:32,635 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2024-11-10 08:07:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2024-11-10 08:07:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:07:32,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:32,638 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:32,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:07:32,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:32,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2103075005, now seen corresponding path program 1 times [2024-11-10 08:07:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963128252] [2024-11-10 08:07:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 08:07:33,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:33,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963128252] [2024-11-10 08:07:33,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963128252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:07:33,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:07:33,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:07:33,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66177944] [2024-11-10 08:07:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:07:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:07:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:07:33,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:07:33,768 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:34,362 INFO L93 Difference]: Finished difference Result 387 states and 567 transitions. [2024-11-10 08:07:34,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 08:07:34,362 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-10 08:07:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:34,365 INFO L225 Difference]: With dead ends: 387 [2024-11-10 08:07:34,365 INFO L226 Difference]: Without dead ends: 280 [2024-11-10 08:07:34,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:07:34,371 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 389 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:34,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 621 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:07:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-10 08:07:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 200. [2024-11-10 08:07:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 144 states have internal predecessors, (195), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:07:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2024-11-10 08:07:34,408 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 144 [2024-11-10 08:07:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:34,410 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2024-11-10 08:07:34,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2024-11-10 08:07:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:07:34,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:34,415 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:34,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:07:34,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1304388610, now seen corresponding path program 1 times [2024-11-10 08:07:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:34,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896434143] [2024-11-10 08:07:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:07:34,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:34,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896434143] [2024-11-10 08:07:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896434143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:07:34,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446174098] [2024-11-10 08:07:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:07:34,980 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 08:07:34,981 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 08:07:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:35,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:07:35,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:07:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-10 08:07:35,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:07:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 08:07:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446174098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:07:35,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:07:35,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-10 08:07:35,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513975049] [2024-11-10 08:07:35,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:07:35,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 08:07:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 08:07:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:07:35,886 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-10 08:07:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:38,220 INFO L93 Difference]: Finished difference Result 846 states and 1225 transitions. [2024-11-10 08:07:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 08:07:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 144 [2024-11-10 08:07:38,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:38,226 INFO L225 Difference]: With dead ends: 846 [2024-11-10 08:07:38,226 INFO L226 Difference]: Without dead ends: 711 [2024-11-10 08:07:38,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1427, Invalid=5545, Unknown=0, NotChecked=0, Total=6972 [2024-11-10 08:07:38,230 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2079 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:38,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 655 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 08:07:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-10 08:07:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 346. [2024-11-10 08:07:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 229 states have (on average 1.240174672489083) internal successors, (284), 230 states have internal predecessors, (284), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-10 08:07:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-10 08:07:38,306 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 144 [2024-11-10 08:07:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:38,307 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-10 08:07:38,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-10 08:07:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-10 08:07:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 08:07:38,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:38,309 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:38,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 08:07:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:38,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:38,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash -133966361, now seen corresponding path program 1 times [2024-11-10 08:07:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:38,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182198817] [2024-11-10 08:07:38,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:38,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:07:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182198817] [2024-11-10 08:07:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182198817] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:07:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999881828] [2024-11-10 08:07:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:38,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:07:38,872 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 08:07:38,874 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 08:07:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:39,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 08:07:39,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:07:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-10 08:07:39,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:07:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:07:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999881828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:07:39,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:07:39,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-10 08:07:39,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101589790] [2024-11-10 08:07:39,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:07:39,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:07:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:39,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:07:39,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:07:39,240 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 08:07:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:39,656 INFO L93 Difference]: Finished difference Result 556 states and 769 transitions. [2024-11-10 08:07:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 08:07:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-10 08:07:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:39,660 INFO L225 Difference]: With dead ends: 556 [2024-11-10 08:07:39,662 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 08:07:39,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:07:39,664 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 195 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:39,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 614 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:07:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 08:07:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2024-11-10 08:07:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 164 states have internal predecessors, (203), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 08:07:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2024-11-10 08:07:39,690 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 145 [2024-11-10 08:07:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:39,691 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2024-11-10 08:07:39,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 08:07:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2024-11-10 08:07:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 08:07:39,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:39,693 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:39,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 08:07:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:39,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:39,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -639524986, now seen corresponding path program 1 times [2024-11-10 08:07:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:39,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665194326] [2024-11-10 08:07:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:07:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665194326] [2024-11-10 08:07:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665194326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:07:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826567914] [2024-11-10 08:07:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:40,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:07:40,526 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 08:07:40,527 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 08:07:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:40,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 08:07:40,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:07:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 440 proven. 33 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-10 08:07:41,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:07:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-10 08:07:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826567914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:07:42,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:07:42,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 31 [2024-11-10 08:07:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906760655] [2024-11-10 08:07:42,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:07:42,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 08:07:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 08:07:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2024-11-10 08:07:42,046 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-10 08:07:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:44,186 INFO L93 Difference]: Finished difference Result 648 states and 854 transitions. [2024-11-10 08:07:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-10 08:07:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) Word has length 145 [2024-11-10 08:07:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:44,189 INFO L225 Difference]: With dead ends: 648 [2024-11-10 08:07:44,189 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 08:07:44,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1371, Invalid=6461, Unknown=0, NotChecked=0, Total=7832 [2024-11-10 08:07:44,193 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1498 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:44,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1230 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 08:07:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 08:07:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 260. [2024-11-10 08:07:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1741573033707866) internal successors, (209), 178 states have internal predecessors, (209), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 08:07:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 329 transitions. [2024-11-10 08:07:44,238 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 329 transitions. Word has length 145 [2024-11-10 08:07:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:44,240 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 329 transitions. [2024-11-10 08:07:44,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-10 08:07:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 329 transitions. [2024-11-10 08:07:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 08:07:44,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:44,243 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:44,265 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 08:07:44,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:07:44,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1451912154, now seen corresponding path program 1 times [2024-11-10 08:07:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696184910] [2024-11-10 08:07:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:07:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:07:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:07:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:07:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:07:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:07:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:07:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:07:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:07:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:07:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:07:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:07:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:07:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:07:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:07:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:07:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 08:07:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 08:07:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 08:07:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 08:07:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:07:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 08:07:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:07:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696184910] [2024-11-10 08:07:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696184910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:07:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:07:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:07:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720388505] [2024-11-10 08:07:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:07:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:07:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:07:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:07:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:07:44,836 INFO L87 Difference]: Start difference. First operand 260 states and 329 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:07:44,964 INFO L93 Difference]: Finished difference Result 447 states and 568 transitions. [2024-11-10 08:07:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:07:44,965 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-10 08:07:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:07:44,967 INFO L225 Difference]: With dead ends: 447 [2024-11-10 08:07:44,967 INFO L226 Difference]: Without dead ends: 260 [2024-11-10 08:07:44,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:07:44,969 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:07:44,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 254 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:07:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-10 08:07:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-10 08:07:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 178 states have internal predecessors, (207), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 08:07:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 327 transitions. [2024-11-10 08:07:44,996 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 327 transitions. Word has length 145 [2024-11-10 08:07:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:07:44,997 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 327 transitions. [2024-11-10 08:07:44,997 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 08:07:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 327 transitions. [2024-11-10 08:07:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 08:07:44,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:07:44,999 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:07:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:07:44,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:07:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:07:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -564408473, now seen corresponding path program 1 times [2024-11-10 08:07:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:07:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175141196] [2024-11-10 08:07:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:07:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:07:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:07:45,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:07:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:07:45,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:07:45,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:07:45,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:07:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:07:45,179 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:07:45,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:07:45,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:07:45 BoogieIcfgContainer [2024-11-10 08:07:45,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:07:45,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:07:45,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:07:45,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:07:45,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:07:29" (3/4) ... [2024-11-10 08:07:45,307 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:07:45,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:07:45,308 INFO L158 Benchmark]: Toolchain (without parser) took 16941.85ms. Allocated memory was 167.8MB in the beginning and 331.4MB in the end (delta: 163.6MB). Free memory was 108.9MB in the beginning and 203.6MB in the end (delta: -94.6MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,309 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:07:45,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.46ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 91.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.12ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 87.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,309 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 82.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,309 INFO L158 Benchmark]: IcfgBuilder took 649.76ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 82.7MB in the beginning and 188.6MB in the end (delta: -105.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,310 INFO L158 Benchmark]: TraceAbstraction took 15750.26ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 188.6MB in the beginning and 204.6MB in the end (delta: -16.0MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2024-11-10 08:07:45,310 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 331.4MB. Free memory was 204.6MB in the beginning and 203.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:07:45,311 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.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.46ms. Allocated memory is still 167.8MB. Free memory was 108.9MB in the beginning and 91.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.12ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 87.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 167.8MB. Free memory was 87.6MB in the beginning and 82.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 649.76ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 82.7MB in the beginning and 188.6MB in the end (delta: -105.9MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15750.26ms. Allocated memory was 228.6MB in the beginning and 331.4MB in the end (delta: 102.8MB). Free memory was 188.6MB in the beginning and 204.6MB in the end (delta: -16.0MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 331.4MB. Free memory was 204.6MB in the beginning and 203.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned char var_1_3 = 200; [L24] unsigned char var_1_4 = 16; [L25] unsigned char var_1_5 = 0; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 64.75; [L28] double var_1_9 = 1.625; [L29] double var_1_10 = 0.0; [L30] double var_1_11 = 15.75; [L31] double var_1_12 = 199.6; [L32] double var_1_13 = 31.625; [L33] float var_1_14 = 2.575; [L34] float var_1_15 = 0.0; [L35] double var_1_16 = 64.8; [L36] double var_1_18 = 8.01; [L37] double var_1_19 = 1000000.5; [L38] unsigned char var_1_22 = 1; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] double var_1_26 = 49.31; [L43] signed long int var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 1; [L47] unsigned short int last_1_var_1_1 = 64; [L48] unsigned char last_1_var_1_22 = 1; [L49] signed long int last_1_var_1_28 = 1; [L50] unsigned char last_1_var_1_29 = 1; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_22 = var_1_22 [L180] last_1_var_1_28 = var_1_28 [L181] last_1_var_1_29 = var_1_29 [L182] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L144] RET assume_abort_if_not(var_1_3 >= 191) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] CALL assume_abort_if_not(var_1_4 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] RET assume_abort_if_not(var_1_4 <= 64) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L152] var_1_8 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L153] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L154] var_1_10 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L155] RET assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L156] var_1_11 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L157] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L160] var_1_15 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L161] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L174] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L193] RET updateVariables() [L194] CALL step() [L55] COND FALSE !(var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L62] signed long int stepLocal_7 = 100; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L63] COND TRUE ! (var_1_10 <= 16.8) [L64] var_1_29 = (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L74] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L75] COND TRUE stepLocal_1 >= var_1_28 [L76] var_1_7 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L78] unsigned char stepLocal_4 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_4=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L79] COND TRUE stepLocal_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) [L80] var_1_14 = ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L84] COND TRUE (- var_1_7) == var_1_10 [L85] var_1_16 = (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L87] var_1_31 = var_1_25 [L88] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L89] COND TRUE \read(var_1_29) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L90] COND TRUE ((var_1_3 - var_1_4) - var_1_5) <= stepLocal_0 [L91] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L94] unsigned char stepLocal_6 = var_1_31; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_6=-256, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L95] COND FALSE !(var_1_31 && stepLocal_6) [L98] var_1_22 = (! (var_1_24 && (! var_1_25))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L105] COND TRUE var_1_12 == var_1_8 [L106] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L111] unsigned char stepLocal_3 = var_1_3; [L112] unsigned char stepLocal_2 = var_1_10 != var_1_9; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_2=0, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L113] COND FALSE !(stepLocal_2 && var_1_29) [L124] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L126] unsigned char stepLocal_5 = var_1_22; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L127] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L134] COND FALSE !(stepLocal_5 || var_1_22) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L138] COND TRUE var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1) [L139] var_1_26 = 25.5 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return (((((((((((var_1_29 ? ((((var_1_3 - var_1_4) - var_1_5) <= var_1_28) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) : 1) && ((var_1_4 >= var_1_28) ? (var_1_7 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_22 ? ((var_1_1 >= var_1_5) ? (var_1_9 == ((double) ((((((var_1_10 - var_1_11) - var_1_12)) < (var_1_8)) ? (((var_1_10 - var_1_11) - var_1_12)) : (var_1_8))))) : 1) : ((var_1_12 == var_1_8) ? (var_1_9 == ((double) var_1_11)) : (var_1_9 == ((double) var_1_12))))) && (((var_1_10 != var_1_9) && var_1_29) ? ((var_1_11 >= (127.5 / var_1_10)) ? ((var_1_3 >= var_1_28) ? (var_1_13 == ((double) var_1_10)) : (var_1_13 == ((double) 9.9999999999996E12))) : (var_1_13 == ((double) var_1_11))) : (var_1_13 == ((double) var_1_12)))) && ((var_1_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) ? (var_1_14 == ((float) ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))))) : (var_1_14 == ((float) var_1_15)))) && (((- var_1_7) == var_1_10) ? (var_1_16 == ((double) (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))))) : 1)) && (var_1_22 ? ((var_1_10 >= (var_1_8 * var_1_13)) ? (var_1_19 == ((double) (var_1_18 - (var_1_15 - var_1_11)))) : (var_1_19 == ((double) ((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) : ((var_1_22 || var_1_22) ? (var_1_19 == ((double) var_1_12)) : 1))) && ((var_1_31 && var_1_31) ? (var_1_22 == ((unsigned char) ((var_1_29 || var_1_23) && var_1_24))) : (var_1_22 == ((unsigned char) (! (var_1_24 && (! var_1_25))))))) && ((var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1)) ? (var_1_26 == ((double) 25.5)) : 1)) && ((var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) ? ((last_1_var_1_29 && last_1_var_1_31) ? (var_1_28 == ((signed long int) last_1_var_1_1)) : (var_1_28 == ((signed long int) last_1_var_1_1))) : 1)) && ((! (var_1_10 <= 16.8)) ? (var_1_29 == ((unsigned char) (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)))) : (((last_1_var_1_28 * (- 2)) <= 100) ? (last_1_var_1_22 ? (var_1_29 == ((unsigned char) 0)) : (var_1_29 == ((unsigned char) (var_1_23 && var_1_24)))) : 1))) && (var_1_31 == ((unsigned char) var_1_25)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4692 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4645 mSDsluCounter, 4046 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3132 mSDsCounter, 1931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2704 IncrementalHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1931 mSolverCounterUnsat, 914 mSDtfsCounter, 2704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 1172 SyntacticMatches, 3 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5137 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 763 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1866 ConstructedInterpolants, 0 QuantifiedInterpolants, 6761 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 9703/9880 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 08:07:45,344 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_operatoramount_amount100_file-34.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 a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:07:47,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:07:47,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:07:47,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:07:47,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:07:47,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:07:47,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:07:47,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:07:47,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:07:47,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:07:47,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:07:47,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:07:47,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:07:47,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:07:47,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:07:47,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:07:47,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:07:47,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:07:47,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:07:47,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:07:47,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:07:47,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:07:47,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:07:47,796 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:07:47,796 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:07:47,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:07:47,797 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:07:47,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:07:47,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:07:47,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:07:47,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:07:47,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:07:47,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:07:47,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:07:47,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:07:47,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:07:47,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:07:47,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:07:47,801 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:07:47,801 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:07:47,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:07:47,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:07:47,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:07:47,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:07:47,802 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 -> a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 [2024-11-10 08:07:48,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:07:48,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:07:48,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:07:48,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:07:48,177 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:07:48,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-10 08:07:49,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:07:49,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:07:49,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-10 08:07:49,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242cc3600/35b917cdbf554773bf3061f5052a5cf7/FLAG53ebec292 [2024-11-10 08:07:49,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/242cc3600/35b917cdbf554773bf3061f5052a5cf7 [2024-11-10 08:07:49,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:07:49,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:07:49,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:07:49,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:07:50,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:07:50,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:07:49" (1/1) ... [2024-11-10 08:07:50,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5dab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50, skipping insertion in model container [2024-11-10 08:07:50,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:07:49" (1/1) ... [2024-11-10 08:07:50,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:07:50,229 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_operatoramount_amount100_file-34.i[916,929] [2024-11-10 08:07:50,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:07:50,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:07:50,357 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_operatoramount_amount100_file-34.i[916,929] [2024-11-10 08:07:50,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:07:50,414 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:07:50,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50 WrapperNode [2024-11-10 08:07:50,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:07:50,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:07:50,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:07:50,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:07:50,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,486 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-10 08:07:50,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:07:50,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:07:50,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:07:50,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:07:50,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,535 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 08:07:50,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:07:50,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:07:50,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:07:50,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:07:50,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (1/1) ... [2024-11-10 08:07:50,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:07:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:07:50,612 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 08:07:50,615 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 08:07:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:07:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:07:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:07:50,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:07:50,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:07:50,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:07:50,781 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:07:50,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:08:15,013 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 08:08:15,013 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:08:15,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:08:15,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:08:15,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:08:15 BoogieIcfgContainer [2024-11-10 08:08:15,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:08:15,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:08:15,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:08:15,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:08:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:07:49" (1/3) ... [2024-11-10 08:08:15,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4caaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:08:15, skipping insertion in model container [2024-11-10 08:08:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:07:50" (2/3) ... [2024-11-10 08:08:15,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4caaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:08:15, skipping insertion in model container [2024-11-10 08:08:15,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:08:15" (3/3) ... [2024-11-10 08:08:15,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-34.i [2024-11-10 08:08:15,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:08:15,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:08:15,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:08:15,133 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;@2169d01a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:08:15,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:08:15,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 08:08:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:08:15,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:08:15,153 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:15,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:08:15,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:08:15,160 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-10 08:08:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:08:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333622573] [2024-11-10 08:08:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:08:15,176 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 08:08:15,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:08:15,179 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 08:08:15,185 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 08:08:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:08:16,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:08:16,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:08:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-10 08:08:16,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:08:16,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:08:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333622573] [2024-11-10 08:08:16,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333622573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:08:16,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:08:16,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:08:16,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802211622] [2024-11-10 08:08:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:08:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:08:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:08:16,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:08:16,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:08:16,648 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 08:08:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:08:16,688 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-10 08:08:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:08:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-10 08:08:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:08:16,699 INFO L225 Difference]: With dead ends: 158 [2024-11-10 08:08:16,700 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 08:08:16,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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 08:08:16,707 INFO L432 NwaCegarLoop]: 118 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, 118 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 08:08:16,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:08:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 08:08:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 08:08:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 08:08:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 08:08:16,745 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-10 08:08:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:08:16,745 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 08:08:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 08:08:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 08:08:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-10 08:08:16,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:08:16,749 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:08:16,792 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 08:08:16,950 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 08:08:16,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:08:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:08:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-10 08:08:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:08:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685691051] [2024-11-10 08:08:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:08:16,953 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 08:08:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:08:16,956 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 08:08:16,957 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 08:08:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:08:18,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 08:08:18,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:08:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-10 08:08:25,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:08:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 08:08:31,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:08:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685691051] [2024-11-10 08:08:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685691051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:08:31,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:08:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-10 08:08:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034526838] [2024-11-10 08:08:31,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:08:31,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:08:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:08:31,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:08:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:08:31,950 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-10 08:08:43,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:08:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []