./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.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 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:03:15,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:03:15,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:03:15,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:03:15,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:03:15,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:03:15,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:03:15,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:03:15,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:03:15,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:03:15,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:03:15,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:03:15,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:03:15,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:03:15,141 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:03:15,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:03:15,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:03:15,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:03:15,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:03:15,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:03:15,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:03:15,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:03:15,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:03:15,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:03:15,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:03:15,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:03:15,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:03:15,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:03:15,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:03:15,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:03:15,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:03:15,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:03:15,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:15,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:03:15,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:03:15,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:03:15,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:03:15,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:03:15,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:03:15,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:03:15,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:03:15,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:03:15,153 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 -> 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 [2024-11-10 06:03:15,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:03:15,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:03:15,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:03:15,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:03:15,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:03:15,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:17,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:03:17,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:03:17,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:17,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dd45ee3/b9600d4dca9e4f66bfa555b359757137/FLAGf4d07b6b5 [2024-11-10 06:03:17,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83dd45ee3/b9600d4dca9e4f66bfa555b359757137 [2024-11-10 06:03:17,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:03:17,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:03:17,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:17,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:03:17,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:03:17,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df685b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17, skipping insertion in model container [2024-11-10 06:03:17,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:03:17,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i[919,932] [2024-11-10 06:03:17,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:17,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:03:17,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i[919,932] [2024-11-10 06:03:17,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:17,784 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:03:17,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17 WrapperNode [2024-11-10 06:03:17,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:17,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:17,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:03:17,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:03:17,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,848 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-11-10 06:03:17,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:17,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:03:17,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:03:17,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:03:17,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,888 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 06:03:17,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:03:17,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:03:17,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:03:17,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:03:17,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (1/1) ... [2024-11-10 06:03:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:17,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:17,963 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 06:03:17,968 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 06:03:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:03:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:03:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:03:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:03:18,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:03:18,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:03:18,115 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:03:18,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:03:18,589 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 06:03:18,590 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:03:18,620 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:03:18,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:03:18,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:18 BoogieIcfgContainer [2024-11-10 06:03:18,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:03:18,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:03:18,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:03:18,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:03:18,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:03:17" (1/3) ... [2024-11-10 06:03:18,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:18, skipping insertion in model container [2024-11-10 06:03:18,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:17" (2/3) ... [2024-11-10 06:03:18,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a16670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:18, skipping insertion in model container [2024-11-10 06:03:18,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:18" (3/3) ... [2024-11-10 06:03:18,629 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:18,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:03:18,646 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:03:18,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:03:18,711 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;@77ce432d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:03:18,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:03:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 06:03:18,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:18,731 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:18,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:18,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1914679234, now seen corresponding path program 1 times [2024-11-10 06:03:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021322973] [2024-11-10 06:03:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021322973] [2024-11-10 06:03:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021322973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:03:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018175299] [2024-11-10 06:03:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:19,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:03:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:03:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:03:19,283 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:19,325 INFO L93 Difference]: Finished difference Result 190 states and 327 transitions. [2024-11-10 06:03:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:03:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2024-11-10 06:03:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:19,339 INFO L225 Difference]: With dead ends: 190 [2024-11-10 06:03:19,339 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 06:03:19,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:03:19,347 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:19,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 06:03:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 06:03:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2024-11-10 06:03:19,399 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 175 [2024-11-10 06:03:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:19,399 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2024-11-10 06:03:19,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-11-10 06:03:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 06:03:19,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:19,406 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:19,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:03:19,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:19,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:19,407 INFO L85 PathProgramCache]: Analyzing trace with hash 760026854, now seen corresponding path program 1 times [2024-11-10 06:03:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:19,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465176790] [2024-11-10 06:03:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:20,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:20,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465176790] [2024-11-10 06:03:20,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465176790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:20,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:20,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:03:20,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870161704] [2024-11-10 06:03:20,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:20,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:03:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:03:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:20,026 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:20,077 INFO L93 Difference]: Finished difference Result 204 states and 312 transitions. [2024-11-10 06:03:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:03:20,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-10 06:03:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:20,080 INFO L225 Difference]: With dead ends: 204 [2024-11-10 06:03:20,080 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 06:03:20,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:20,081 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 20 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:20,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 284 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 06:03:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2024-11-10 06:03:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-10 06:03:20,092 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 175 [2024-11-10 06:03:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:20,093 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-10 06:03:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-10 06:03:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 06:03:20,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:20,095 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:03:20,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash -715386781, now seen corresponding path program 1 times [2024-11-10 06:03:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:20,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161585413] [2024-11-10 06:03:20,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161585413] [2024-11-10 06:03:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161585413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:03:20,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327247145] [2024-11-10 06:03:20,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:20,391 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:20,559 INFO L93 Difference]: Finished difference Result 284 states and 441 transitions. [2024-11-10 06:03:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 176 [2024-11-10 06:03:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:20,562 INFO L225 Difference]: With dead ends: 284 [2024-11-10 06:03:20,562 INFO L226 Difference]: Without dead ends: 189 [2024-11-10 06:03:20,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:03:20,563 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 242 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:20,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 260 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:03:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-10 06:03:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 98. [2024-11-10 06:03:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2024-11-10 06:03:20,575 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 176 [2024-11-10 06:03:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:20,576 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2024-11-10 06:03:20,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2024-11-10 06:03:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 06:03:20,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:20,578 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:20,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:03:20,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:20,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1965729217, now seen corresponding path program 1 times [2024-11-10 06:03:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106513545] [2024-11-10 06:03:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106513545] [2024-11-10 06:03:20,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106513545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:20,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:20,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:03:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264631521] [2024-11-10 06:03:20,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:20,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:03:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:03:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:20,880 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:20,924 INFO L93 Difference]: Finished difference Result 194 states and 301 transitions. [2024-11-10 06:03:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:03:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 06:03:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:20,927 INFO L225 Difference]: With dead ends: 194 [2024-11-10 06:03:20,927 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 06:03:20,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:03:20,929 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:20,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 06:03:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-10 06:03:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2024-11-10 06:03:20,949 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 176 [2024-11-10 06:03:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:20,950 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2024-11-10 06:03:20,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:20,951 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2024-11-10 06:03:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 06:03:20,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:20,955 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:20,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:03:20,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 71523754, now seen corresponding path program 1 times [2024-11-10 06:03:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222010296] [2024-11-10 06:03:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222010296] [2024-11-10 06:03:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222010296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:21,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:03:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745518591] [2024-11-10 06:03:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:21,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:21,397 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:21,491 INFO L93 Difference]: Finished difference Result 239 states and 357 transitions. [2024-11-10 06:03:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:21,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 06:03:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:21,493 INFO L225 Difference]: With dead ends: 239 [2024-11-10 06:03:21,493 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 06:03:21,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:21,494 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:21,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 387 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:03:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 06:03:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 116. [2024-11-10 06:03:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 83 states have internal predecessors, (112), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 06:03:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-11-10 06:03:21,507 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 177 [2024-11-10 06:03:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:21,508 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-11-10 06:03:21,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-11-10 06:03:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 06:03:21,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:21,509 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:21,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:03:21,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:21,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1735930709, now seen corresponding path program 1 times [2024-11-10 06:03:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:21,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433717816] [2024-11-10 06:03:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433717816] [2024-11-10 06:03:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433717816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:03:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483943294] [2024-11-10 06:03:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:21,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:21,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:21,828 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 06:03:21,839 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 06:03:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:21,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:03:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 06:03:22,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483943294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:22,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:03:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 06:03:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420401053] [2024-11-10 06:03:22,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:22,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:03:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:03:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:03:22,486 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 06:03:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:22,712 INFO L93 Difference]: Finished difference Result 223 states and 332 transitions. [2024-11-10 06:03:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:03:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 177 [2024-11-10 06:03:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:22,716 INFO L225 Difference]: With dead ends: 223 [2024-11-10 06:03:22,716 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 06:03:22,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:03:22,718 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 64 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:22,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 302 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:03:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 06:03:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2024-11-10 06:03:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 82 states have (on average 1.329268292682927) internal successors, (109), 83 states have internal predecessors, (109), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 06:03:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2024-11-10 06:03:22,743 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 177 [2024-11-10 06:03:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:22,744 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2024-11-10 06:03:22,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 06:03:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2024-11-10 06:03:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 06:03:22,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:22,747 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:22,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:03:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 06:03:22,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1725427605, now seen corresponding path program 1 times [2024-11-10 06:03:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55116507] [2024-11-10 06:03:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:23,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:23,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55116507] [2024-11-10 06:03:23,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55116507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:23,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:23,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:03:23,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339123592] [2024-11-10 06:03:23,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:23,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:23,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:23,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:23,281 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:23,359 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2024-11-10 06:03:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:23,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 06:03:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:23,361 INFO L225 Difference]: With dead ends: 284 [2024-11-10 06:03:23,361 INFO L226 Difference]: Without dead ends: 180 [2024-11-10 06:03:23,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:23,365 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 85 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:23,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 383 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:03:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-10 06:03:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 139. [2024-11-10 06:03:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.4220183486238531) internal successors, (155), 109 states have internal predecessors, (155), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 207 transitions. [2024-11-10 06:03:23,381 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 207 transitions. Word has length 177 [2024-11-10 06:03:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:23,381 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 207 transitions. [2024-11-10 06:03:23,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 207 transitions. [2024-11-10 06:03:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 06:03:23,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:23,383 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:23,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:03:23,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:23,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash 762085228, now seen corresponding path program 1 times [2024-11-10 06:03:23,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:23,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769047688] [2024-11-10 06:03:23,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769047688] [2024-11-10 06:03:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769047688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:03:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747491699] [2024-11-10 06:03:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:23,697 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 06:03:23,704 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 06:03:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:23,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 06:03:23,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 543 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 06:03:24,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747491699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:24,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:03:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 06:03:24,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834810074] [2024-11-10 06:03:24,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:24,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:03:24,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:03:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:03:24,206 INFO L87 Difference]: Start difference. First operand 139 states and 207 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-10 06:03:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:24,437 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2024-11-10 06:03:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 06:03:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 177 [2024-11-10 06:03:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:24,439 INFO L225 Difference]: With dead ends: 298 [2024-11-10 06:03:24,439 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 06:03:24,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 06:03:24,440 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 158 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:24,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 394 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:03:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 06:03:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-10 06:03:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 91 states have internal predecessors, (113), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:03:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-10 06:03:24,453 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 177 [2024-11-10 06:03:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-10 06:03:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-10 06:03:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-10 06:03:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 06:03:24,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:24,455 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:24,468 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 06:03:24,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 06:03:24,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:24,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2089407636, now seen corresponding path program 1 times [2024-11-10 06:03:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:24,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330468960] [2024-11-10 06:03:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330468960] [2024-11-10 06:03:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330468960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:03:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891793487] [2024-11-10 06:03:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:24,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:24,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:24,927 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 06:03:24,932 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 06:03:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:25,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:03:25,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 603 proven. 24 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-11-10 06:03:25,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:25,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891793487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:25,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:03:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 06:03:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540603603] [2024-11-10 06:03:25,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:03:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:25,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:03:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:03:25,387 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-10 06:03:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:25,668 INFO L93 Difference]: Finished difference Result 242 states and 334 transitions. [2024-11-10 06:03:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:03:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 178 [2024-11-10 06:03:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:25,673 INFO L225 Difference]: With dead ends: 242 [2024-11-10 06:03:25,673 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 06:03:25,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:03:25,674 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:25,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 224 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:03:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 06:03:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-10 06:03:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 94 states have internal predecessors, (113), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:03:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2024-11-10 06:03:25,699 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 178 [2024-11-10 06:03:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2024-11-10 06:03:25,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-10 06:03:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2024-11-10 06:03:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 06:03:25,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:25,703 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:25,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 06:03:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:25,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:25,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 333685352, now seen corresponding path program 1 times [2024-11-10 06:03:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53557846] [2024-11-10 06:03:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53557846] [2024-11-10 06:03:26,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53557846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:03:26,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151808525] [2024-11-10 06:03:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:26,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:26,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:26,237 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:03:26,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 06:03:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:26,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 06:03:26,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-10 06:03:26,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 06:03:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151808525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:26,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:03:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-10 06:03:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029845201] [2024-11-10 06:03:26,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 06:03:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 06:03:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:03:26,659 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-10 06:03:26,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:26,901 INFO L93 Difference]: Finished difference Result 250 states and 334 transitions. [2024-11-10 06:03:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 06:03:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 179 [2024-11-10 06:03:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:26,904 INFO L225 Difference]: With dead ends: 250 [2024-11-10 06:03:26,904 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 06:03:26,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-10 06:03:26,905 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 154 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:26,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 234 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:03:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 06:03:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-11-10 06:03:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 96 states have (on average 1.1875) internal successors, (114), 97 states have internal predecessors, (114), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 06:03:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2024-11-10 06:03:26,931 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 179 [2024-11-10 06:03:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2024-11-10 06:03:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2024-11-10 06:03:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2024-11-10 06:03:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 06:03:26,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:26,935 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:26,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 06:03:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:27,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1182855662, now seen corresponding path program 1 times [2024-11-10 06:03:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394052364] [2024-11-10 06:03:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:03:27,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756541495] [2024-11-10 06:03:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:27,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:27,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:03:27,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 06:03:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:27,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 06:03:27,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:27,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:03:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394052364] [2024-11-10 06:03:27,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 06:03:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756541495] [2024-11-10 06:03:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756541495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:27,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:03:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001704064] [2024-11-10 06:03:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:27,981 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:28,193 INFO L93 Difference]: Finished difference Result 358 states and 473 transitions. [2024-11-10 06:03:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-10 06:03:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:28,197 INFO L225 Difference]: With dead ends: 358 [2024-11-10 06:03:28,197 INFO L226 Difference]: Without dead ends: 244 [2024-11-10 06:03:28,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:03:28,198 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 112 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:28,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 374 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:03:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-10 06:03:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 209. [2024-11-10 06:03:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 144 states have (on average 1.1805555555555556) internal successors, (170), 144 states have internal predecessors, (170), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 06:03:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 274 transitions. [2024-11-10 06:03:28,240 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 274 transitions. Word has length 180 [2024-11-10 06:03:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:28,241 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 274 transitions. [2024-11-10 06:03:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2024-11-10 06:03:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 06:03:28,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:28,244 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:28,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 06:03:28,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 06:03:28,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:28,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1247731015, now seen corresponding path program 1 times [2024-11-10 06:03:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106553907] [2024-11-10 06:03:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106553907] [2024-11-10 06:03:28,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106553907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:28,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:03:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832706768] [2024-11-10 06:03:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:28,734 INFO L87 Difference]: Start difference. First operand 209 states and 274 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:28,886 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2024-11-10 06:03:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 181 [2024-11-10 06:03:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:28,890 INFO L225 Difference]: With dead ends: 366 [2024-11-10 06:03:28,890 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 06:03:28,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:03:28,891 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 98 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:28,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 367 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:03:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 06:03:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2024-11-10 06:03:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 145 states have (on average 1.1655172413793105) internal successors, (169), 145 states have internal predecessors, (169), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 06:03:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2024-11-10 06:03:28,930 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 181 [2024-11-10 06:03:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2024-11-10 06:03:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2024-11-10 06:03:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 06:03:28,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:28,933 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:28,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 06:03:28,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -12771652, now seen corresponding path program 1 times [2024-11-10 06:03:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163460288] [2024-11-10 06:03:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:03:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:03:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:03:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 06:03:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:03:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 06:03:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:03:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:03:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:03:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:03:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:03:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:03:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 06:03:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:03:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 06:03:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:03:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 06:03:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:03:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 06:03:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 06:03:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 06:03:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 06:03:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 06:03:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 06:03:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 06:03:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 06:03:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:03:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:03:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163460288] [2024-11-10 06:03:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163460288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:03:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366863523] [2024-11-10 06:03:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:03:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:03:29,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:03:29,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:03:29,149 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:29,321 INFO L93 Difference]: Finished difference Result 434 states and 569 transitions. [2024-11-10 06:03:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:03:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 181 [2024-11-10 06:03:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:29,324 INFO L225 Difference]: With dead ends: 434 [2024-11-10 06:03:29,327 INFO L226 Difference]: Without dead ends: 320 [2024-11-10 06:03:29,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:03:29,328 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 188 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:03:29,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 234 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:03:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-10 06:03:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 206. [2024-11-10 06:03:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 141 states have internal predecessors, (163), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 06:03:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 267 transitions. [2024-11-10 06:03:29,373 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 267 transitions. Word has length 181 [2024-11-10 06:03:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:29,375 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 267 transitions. [2024-11-10 06:03:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:03:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2024-11-10 06:03:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 06:03:29,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:29,378 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:29,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 06:03:29,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:29,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -10629364, now seen corresponding path program 1 times [2024-11-10 06:03:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:03:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153420739] [2024-11-10 06:03:29,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:03:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:03:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302652763] [2024-11-10 06:03:29,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:29,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:03:29,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 06:03:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:03:29,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:03:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:03:29,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:03:29,885 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:03:29,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:03:29,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 06:03:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:03:30,093 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:30,244 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:03:30,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:03:30 BoogieIcfgContainer [2024-11-10 06:03:30,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:03:30,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:03:30,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:03:30,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:03:30,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:18" (3/4) ... [2024-11-10 06:03:30,251 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:03:30,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:03:30,252 INFO L158 Benchmark]: Toolchain (without parser) took 12847.02ms. Allocated memory was 172.0MB in the beginning and 358.6MB in the end (delta: 186.6MB). Free memory was 100.8MB in the beginning and 190.2MB in the end (delta: -89.3MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,253 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:03:30,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.41ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 83.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.58ms. Allocated memory is still 172.0MB. Free memory was 83.5MB in the beginning and 80.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,253 INFO L158 Benchmark]: Boogie Preprocessor took 75.36ms. Allocated memory is still 172.0MB. Free memory was 80.0MB in the beginning and 76.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,253 INFO L158 Benchmark]: IcfgBuilder took 695.76ms. Allocated memory is still 172.0MB. Free memory was 75.8MB in the beginning and 125.7MB in the end (delta: -49.9MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,254 INFO L158 Benchmark]: TraceAbstraction took 11623.72ms. Allocated memory was 172.0MB in the beginning and 358.6MB in the end (delta: 186.6MB). Free memory was 124.8MB in the beginning and 191.2MB in the end (delta: -66.4MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2024-11-10 06:03:30,254 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 358.6MB. Free memory was 191.2MB in the beginning and 190.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:03:30,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.41ms. Allocated memory is still 172.0MB. Free memory was 100.6MB in the beginning and 83.5MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.58ms. Allocated memory is still 172.0MB. Free memory was 83.5MB in the beginning and 80.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.36ms. Allocated memory is still 172.0MB. Free memory was 80.0MB in the beginning and 76.1MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 695.76ms. Allocated memory is still 172.0MB. Free memory was 75.8MB in the beginning and 125.7MB in the end (delta: -49.9MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11623.72ms. Allocated memory was 172.0MB in the beginning and 358.6MB in the end (delta: 186.6MB). Free memory was 124.8MB in the beginning and 191.2MB in the end (delta: -66.4MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 358.6MB. Free memory was 191.2MB in the beginning and 190.2MB 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 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 198. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_37 = 3773873024; [L42] unsigned long int var_1_38 = 2296504360; [L43] unsigned long int var_1_39 = 16; [L44] unsigned long int var_1_40 = 2753961414; [L45] unsigned char var_1_41 = 8; [L46] signed short int var_1_43 = -50; [L47] signed char var_1_44 = -1; [L48] double var_1_47 = 255.2; [L49] double var_1_50 = 50.4; [L50] double var_1_51 = 49.25; [L51] double var_1_52 = 1000000.4; [L52] double var_1_53 = 256.2; [L53] signed char var_1_54 = -8; [L54] unsigned char last_1_var_1_17 = 1; [L55] double last_1_var_1_20 = 9.25; [L56] unsigned char last_1_var_1_23 = 2; [L57] unsigned short int last_1_var_1_26 = 5; [L58] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L191] last_1_var_1_17 = var_1_17 [L192] last_1_var_1_20 = var_1_20 [L193] last_1_var_1_23 = var_1_23 [L194] last_1_var_1_26 = var_1_26 [L195] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L147] var_1_11 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L148] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L149] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L150] var_1_14 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L151] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L152] var_1_16 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L153] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L154] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L155] var_1_18 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L156] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L157] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L158] var_1_19 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L159] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L160] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L161] var_1_21 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L162] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L163] var_1_22 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L164] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L165] var_1_25 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L167] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L168] var_1_27 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L169] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L170] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L171] var_1_28 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L172] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L173] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=3773873024, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L174] var_1_37 = __VERIFIER_nondet_ulong() [L175] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L175] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L176] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=2296504360, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L177] var_1_38 = __VERIFIER_nondet_ulong() [L178] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L178] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L179] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2753961414, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L180] var_1_40 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_40 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L181] RET assume_abort_if_not(var_1_40 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] CALL assume_abort_if_not(var_1_40 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L182] RET assume_abort_if_not(var_1_40 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_50=252/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L183] var_1_50 = __VERIFIER_nondet_double() [L184] CALL assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L184] RET assume_abort_if_not((var_1_50 >= 0.0F && var_1_50 <= -1.0e-20F) || (var_1_50 <= 9223372.036854765600e+12F && var_1_50 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_51=197/4, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L185] var_1_51 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L186] RET assume_abort_if_not((var_1_51 >= 0.0F && var_1_51 <= -1.0e-20F) || (var_1_51 <= 9223372.036854765600e+12F && var_1_51 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_52=5000002/5, var_1_53=1281/5, var_1_54=-8] [L187] var_1_52 = __VERIFIER_nondet_double() [L188] CALL assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L188] RET assume_abort_if_not((var_1_52 >= 0.0F && var_1_52 <= -1.0e-20F) || (var_1_52 <= 9223372.036854765600e+12F && var_1_52 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L206] RET updateVariables() [L207] CALL step() [L62] COND TRUE var_1_18 && var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=64, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L63] COND TRUE var_1_26 <= var_1_29 [L64] var_1_32 = (((((var_1_37) < (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))))) ? (var_1_37) : (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38)))))) - var_1_26) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=16, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L67] COND TRUE (- var_1_38) <= (- var_1_37) [L68] var_1_39 = (2368197193u - var_1_23) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=8, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L76] var_1_41 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L77] COND FALSE !(var_1_37 <= ((((var_1_26) > (var_1_25)) ? (var_1_26) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] EXPR var_1_37 ^ var_1_40 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] EXPR ((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=-1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L80] COND TRUE var_1_25 <= ((((-8) > ((var_1_37 ^ var_1_40))) ? (-8) : ((var_1_37 ^ var_1_40)))) [L81] COND TRUE \read(var_1_17) [L82] var_1_44 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L87] COND TRUE var_1_17 || var_1_19 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=1276/5, var_1_53=1281/5, var_1_54=-8] [L88] COND TRUE var_1_11 >= var_1_11 [L89] var_1_47 = var_1_21 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=1281/5, var_1_54=-8] [L102] var_1_53 = 5.5 [L103] var_1_54 = var_1_16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L104] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L107] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L108] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L109] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=2, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L117] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L118] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L120] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L121] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L124] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=5, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L125] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L126] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L133] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=80, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L134] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L141] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=80, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=128, var_1_31=1, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L143] var_1_31 = var_1_26 [L144] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=80, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=-50, var_1_31=16, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=-50, var_1_31=16, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=-50, var_1_31=16, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_21=2, var_1_23=5, var_1_25=5, var_1_26=16, var_1_27=127, var_1_28=122, var_1_29=-50, var_1_31=16, var_1_32=6442450938, var_1_37=-2147483649, var_1_38=6442450943, var_1_39=2368197191, var_1_40=2147483647, var_1_41=5, var_1_43=-50, var_1_44=1, var_1_47=2, var_1_53=11/2, var_1_54=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1467 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1412 mSDsluCounter, 3852 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2159 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1053 IncrementalHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 1693 mSDtfsCounter, 1053 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 2257 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=12, InterpolantAutomatonStates: 68, 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, 13 MinimizatonAttempts, 356 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 3564 NumberOfCodeBlocks, 3564 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3710 ConstructedInterpolants, 0 QuantifiedInterpolants, 7957 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2152 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 26850/27300 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 06:03:30,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.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 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:03:33,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:03:33,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:03:33,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:03:33,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:03:33,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:03:33,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:03:33,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:03:33,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:03:33,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:03:33,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:03:33,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:03:33,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:03:33,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:03:33,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:03:33,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:03:33,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:03:33,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:03:33,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:03:33,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:03:33,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:03:33,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:03:33,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:03:33,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:03:33,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:03:33,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:03:33,190 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:03:33,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:03:33,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:03:33,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:03:33,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:03:33,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:03:33,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:03:33,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:03:33,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:33,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:03:33,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:03:33,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:03:33,197 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:03:33,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:03:33,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:03:33,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:03:33,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:03:33,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:03:33,198 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 -> 8107c0950a870cc29b997c6f0f9031935a5c6964463abd6d158718f97c83e768 [2024-11-10 06:03:33,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:03:33,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:03:33,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:03:33,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:03:33,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:03:33,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:35,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:03:35,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:03:35,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:35,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f5e87c6/5ee6e7f8a2854f7da8c4637476d3db99/FLAG290a9fdb0 [2024-11-10 06:03:35,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15f5e87c6/5ee6e7f8a2854f7da8c4637476d3db99 [2024-11-10 06:03:35,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:03:35,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:03:35,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:35,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:03:35,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:03:35,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:35" (1/1) ... [2024-11-10 06:03:35,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295ce0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:35, skipping insertion in model container [2024-11-10 06:03:35,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:35" (1/1) ... [2024-11-10 06:03:36,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:03:36,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i[919,932] [2024-11-10 06:03:36,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:36,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:03:36,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i[919,932] [2024-11-10 06:03:36,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:03:36,478 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:03:36,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36 WrapperNode [2024-11-10 06:03:36,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:03:36,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:36,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:03:36,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:03:36,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,550 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-10 06:03:36,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:03:36,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:03:36,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:03:36,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:03:36,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,603 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 06:03:36,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,621 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:03:36,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:03:36,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:03:36,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:03:36,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (1/1) ... [2024-11-10 06:03:36,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:03:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:03:36,693 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 06:03:36,698 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 06:03:36,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:03:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:03:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:03:36,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:03:36,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:03:36,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:03:36,839 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:03:36,843 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:03:50,728 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:03:50,728 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:03:50,747 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:03:50,747 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:03:50,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:50 BoogieIcfgContainer [2024-11-10 06:03:50,752 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:03:50,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:03:50,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:03:50,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:03:50,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:03:35" (1/3) ... [2024-11-10 06:03:50,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca6a354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:50, skipping insertion in model container [2024-11-10 06:03:50,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:36" (2/3) ... [2024-11-10 06:03:50,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca6a354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:50, skipping insertion in model container [2024-11-10 06:03:50,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:50" (3/3) ... [2024-11-10 06:03:50,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-72.i [2024-11-10 06:03:50,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:03:50,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:03:50,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:03:50,861 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;@567c7989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:03:50,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:03:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 06:03:50,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:50,883 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:50,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:50,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2109411082, now seen corresponding path program 1 times [2024-11-10 06:03:50,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:03:50,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128866110] [2024-11-10 06:03:50,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:50,906 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 06:03:50,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:03:50,915 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 06:03:50,935 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 06:03:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:51,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:03:51,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-10 06:03:51,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:03:51,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:03:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128866110] [2024-11-10 06:03:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128866110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:03:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:03:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:03:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089211167] [2024-11-10 06:03:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:03:51,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:03:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:03:51,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:03:51,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:03:51,952 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:03:51,985 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2024-11-10 06:03:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:03:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-11-10 06:03:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:03:51,996 INFO L225 Difference]: With dead ends: 170 [2024-11-10 06:03:51,996 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 06:03:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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 06:03:52,002 INFO L432 NwaCegarLoop]: 126 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, 126 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 06:03:52,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:03:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 06:03:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 06:03:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 06:03:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-10 06:03:52,064 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 173 [2024-11-10 06:03:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:03:52,065 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-10 06:03:52,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 06:03:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-10 06:03:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-10 06:03:52,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:03:52,073 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:03:52,097 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 06:03:52,282 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 06:03:52,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:03:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:03:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1362042464, now seen corresponding path program 1 times [2024-11-10 06:03:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:03:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910215954] [2024-11-10 06:03:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:03:52,285 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 06:03:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:03:52,289 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 06:03:52,290 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 06:03:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:03:52,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 06:03:52,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:03:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 531 proven. 111 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-11-10 06:03:56,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:03:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 114 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-10 06:03:59,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:03:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910215954] [2024-11-10 06:03:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910215954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:03:59,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 06:03:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-11-10 06:03:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579299300] [2024-11-10 06:03:59,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 06:03:59,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 06:03:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:03:59,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 06:03:59,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 06:03:59,771 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 06:04:06,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:04:10,468 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 [] [2024-11-10 06:04:14,472 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 [] [2024-11-10 06:04:18,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:04:22,485 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 [] [2024-11-10 06:04:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:04:23,157 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2024-11-10 06:04:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 06:04:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 175 [2024-11-10 06:04:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:04:23,166 INFO L225 Difference]: With dead ends: 189 [2024-11-10 06:04:23,167 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 06:04:23,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2024-11-10 06:04:23,173 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 115 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 29 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2024-11-10 06:04:23,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 288 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 266 Invalid, 5 Unknown, 0 Unchecked, 22.8s Time] [2024-11-10 06:04:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 06:04:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-11-10 06:04:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 06:04:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2024-11-10 06:04:23,227 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 175 [2024-11-10 06:04:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:04:23,235 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2024-11-10 06:04:23,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (46), 3 states have call predecessors, (46), 7 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 06:04:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2024-11-10 06:04:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 06:04:23,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:04:23,246 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:04:23,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:04:23,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:04:23,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:04:23,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:04:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash 679118037, now seen corresponding path program 1 times [2024-11-10 06:04:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:04:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276786452] [2024-11-10 06:04:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:04:23,452 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 06:04:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:04:23,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:04:23,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:04:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:04:24,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:04:24,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:04:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 06:04:29,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:04:29,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:04:29,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276786452] [2024-11-10 06:04:29,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276786452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:04:29,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:04:29,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:04:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141141953] [2024-11-10 06:04:29,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:04:29,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:04:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:04:29,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:04:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:04:29,896 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 06:04:34,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:04:38,499 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 [] [2024-11-10 06:04:42,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []