./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:11:15,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:11:15,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:11:15,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:11:15,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:11:15,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:11:15,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:11:15,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:11:15,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:11:15,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:11:15,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:11:15,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:11:15,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:11:15,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:11:15,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:11:15,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:11:15,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:11:15,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:11:15,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:11:15,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:11:15,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:11:15,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:11:15,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:11:15,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:11:15,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:11:15,692 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:11:15,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:11:15,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:11:15,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:11:15,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:11:15,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:11:15,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:11:15,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:11:15,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:11:15,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:11:15,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:11:15,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:11:15,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:11:15,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:11:15,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:11:15,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:11:15,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:11:15,697 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-clean/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-clean/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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-10-11 08:11:15,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:11:15,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:11:15,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:11:15,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:11:15,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:11:15,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:17,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:11:17,508 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:11:17,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:17,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad03e42e2/ae476dde0cc944419f1e8fbf1bae2a81/FLAG9eddb6aee [2024-10-11 08:11:17,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad03e42e2/ae476dde0cc944419f1e8fbf1bae2a81 [2024-10-11 08:11:17,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:11:17,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:11:17,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:11:17,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:11:17,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:11:17,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4fb866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17, skipping insertion in model container [2024-10-11 08:11:17,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:11:17,696 WARN L248 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_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-10-11 08:11:17,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:11:17,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:11:17,782 WARN L248 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_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-10-11 08:11:17,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:11:17,843 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:11:17,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17 WrapperNode [2024-10-11 08:11:17,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:11:17,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:11:17,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:11:17,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:11:17,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,914 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-10-11 08:11:17,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:11:17,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:11:17,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:11:17,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:11:17,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,944 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-10-11 08:11:17,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:11:17,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:11:17,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:11:17,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:11:17,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (1/1) ... [2024-10-11 08:11:17,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:11:17,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:11:17,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:11:17,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:11:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:11:18,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:11:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:11:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:11:18,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:11:18,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:11:18,170 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:11:18,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:11:18,429 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 08:11:18,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:11:18,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:11:18,465 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:11:18,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:18 BoogieIcfgContainer [2024-10-11 08:11:18,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:11:18,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:11:18,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:11:18,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:11:18,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:11:17" (1/3) ... [2024-10-11 08:11:18,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376f01b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:18, skipping insertion in model container [2024-10-11 08:11:18,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:17" (2/3) ... [2024-10-11 08:11:18,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376f01b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:18, skipping insertion in model container [2024-10-11 08:11:18,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:18" (3/3) ... [2024-10-11 08:11:18,477 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:18,493 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:11:18,493 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:11:18,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:11:18,555 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;@112223ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:11:18,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:11:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 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-10-11 08:11:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:11:18,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:18,571 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] [2024-10-11 08:11:18,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:18,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash -575179931, now seen corresponding path program 1 times [2024-10-11 08:11:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800962071] [2024-10-11 08:11:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800962071] [2024-10-11 08:11:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800962071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:11:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120204205] [2024-10-11 08:11:18,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:18,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:11:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:18,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:11:18,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:11:18,978 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-11 08:11:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:19,016 INFO L93 Difference]: Finished difference Result 171 states and 292 transitions. [2024-10-11 08:11:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:11:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 167 [2024-10-11 08:11:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:19,028 INFO L225 Difference]: With dead ends: 171 [2024-10-11 08:11:19,029 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 08:11:19,033 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-10-11 08:11:19,036 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:19,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:11:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 08:11:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 08:11:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 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-10-11 08:11:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-10-11 08:11:19,150 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 167 [2024-10-11 08:11:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:19,151 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-10-11 08:11:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-10-11 08:11:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-10-11 08:11:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 08:11:19,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:19,156 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] [2024-10-11 08:11:19,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:11:19,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:19,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:19,157 INFO L85 PathProgramCache]: Analyzing trace with hash -168058979, now seen corresponding path program 1 times [2024-10-11 08:11:19,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:19,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168271254] [2024-10-11 08:11:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168271254] [2024-10-11 08:11:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168271254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:19,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:11:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833909996] [2024-10-11 08:11:19,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:19,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:11:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:11:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:11:19,403 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 08:11:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:19,445 INFO L93 Difference]: Finished difference Result 170 states and 259 transitions. [2024-10-11 08:11:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:11:19,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 167 [2024-10-11 08:11:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:19,452 INFO L225 Difference]: With dead ends: 170 [2024-10-11 08:11:19,453 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 08:11:19,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-11 08:11:19,455 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:19,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:11:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 08:11:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 08:11:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 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-10-11 08:11:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-10-11 08:11:19,468 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 167 [2024-10-11 08:11:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:19,469 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-10-11 08:11:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 08:11:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-10-11 08:11:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:11:19,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:19,472 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] [2024-10-11 08:11:19,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:11:19,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash -405323291, now seen corresponding path program 1 times [2024-10-11 08:11:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892240284] [2024-10-11 08:11:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:22,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892240284] [2024-10-11 08:11:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892240284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:11:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722397770] [2024-10-11 08:11:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:11:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:11:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:11:22,133 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:22,865 INFO L93 Difference]: Finished difference Result 247 states and 369 transitions. [2024-10-11 08:11:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:11:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 168 [2024-10-11 08:11:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:22,869 INFO L225 Difference]: With dead ends: 247 [2024-10-11 08:11:22,872 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 08:11:22,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:22,874 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 91 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:22,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 556 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:11:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 08:11:22,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 112. [2024-10-11 08:11:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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-10-11 08:11:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-10-11 08:11:22,893 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 168 [2024-10-11 08:11:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:22,894 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-10-11 08:11:22,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-10-11 08:11:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:11:22,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:22,900 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] [2024-10-11 08:11:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:11:22,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:22,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1895499299, now seen corresponding path program 1 times [2024-10-11 08:11:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791482051] [2024-10-11 08:11:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791482051] [2024-10-11 08:11:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791482051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:24,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:11:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636402550] [2024-10-11 08:11:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:24,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:11:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:11:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:11:24,966 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:25,820 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2024-10-11 08:11:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:11:25,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 168 [2024-10-11 08:11:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:25,822 INFO L225 Difference]: With dead ends: 275 [2024-10-11 08:11:25,822 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 08:11:25,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:25,824 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 91 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:25,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 464 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 08:11:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 08:11:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2024-10-11 08:11:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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-10-11 08:11:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-10-11 08:11:25,831 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 168 [2024-10-11 08:11:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:25,831 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-10-11 08:11:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-10-11 08:11:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:11:25,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:25,836 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] [2024-10-11 08:11:25,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:11:25,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1222971741, now seen corresponding path program 1 times [2024-10-11 08:11:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908734129] [2024-10-11 08:11:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908734129] [2024-10-11 08:11:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908734129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:26,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:11:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008755712] [2024-10-11 08:11:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:26,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:11:26,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:11:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:11:26,563 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:26,824 INFO L93 Difference]: Finished difference Result 286 states and 432 transitions. [2024-10-11 08:11:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:11:26,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 168 [2024-10-11 08:11:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:26,826 INFO L225 Difference]: With dead ends: 286 [2024-10-11 08:11:26,826 INFO L226 Difference]: Without dead ends: 175 [2024-10-11 08:11:26,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:26,827 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 123 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:26,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 364 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:11:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-11 08:11:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 112. [2024-10-11 08:11:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 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-10-11 08:11:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-10-11 08:11:26,842 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 168 [2024-10-11 08:11:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:26,842 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-10-11 08:11:26,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-10-11 08:11:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 08:11:26,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:26,846 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] [2024-10-11 08:11:26,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:11:26,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1077850849, now seen corresponding path program 1 times [2024-10-11 08:11:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74972628] [2024-10-11 08:11:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74972628] [2024-10-11 08:11:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74972628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:27,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:11:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548073088] [2024-10-11 08:11:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:27,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:11:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:11:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:11:27,494 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:27,847 INFO L93 Difference]: Finished difference Result 277 states and 413 transitions. [2024-10-11 08:11:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:11:27,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 168 [2024-10-11 08:11:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:27,849 INFO L225 Difference]: With dead ends: 277 [2024-10-11 08:11:27,849 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 08:11:27,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:27,851 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 91 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:27,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 660 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:11:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 08:11:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 88. [2024-10-11 08:11:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 60 states have internal predecessors, (80), 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-10-11 08:11:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2024-10-11 08:11:27,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 168 [2024-10-11 08:11:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:27,861 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2024-10-11 08:11:27,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-10-11 08:11:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-10-11 08:11:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:11:27,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:27,864 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] [2024-10-11 08:11:27,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:11:27,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:27,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:27,865 INFO L85 PathProgramCache]: Analyzing trace with hash 952129194, now seen corresponding path program 1 times [2024-10-11 08:11:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199071800] [2024-10-11 08:11:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199071800] [2024-10-11 08:11:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199071800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:11:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674987464] [2024-10-11 08:11:27,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:11:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:27,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:11:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:11:27,967 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-11 08:11:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:28,022 INFO L93 Difference]: Finished difference Result 257 states and 387 transitions. [2024-10-11 08:11:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:11:28,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 170 [2024-10-11 08:11:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:28,024 INFO L225 Difference]: With dead ends: 257 [2024-10-11 08:11:28,024 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 08:11:28,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-11 08:11:28,027 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 110 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:28,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 232 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:11:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 08:11:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 114. [2024-10-11 08:11:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-10-11 08:11:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2024-10-11 08:11:28,040 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 170 [2024-10-11 08:11:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:28,042 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2024-10-11 08:11:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-11 08:11:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2024-10-11 08:11:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:11:28,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:28,044 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] [2024-10-11 08:11:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:11:28,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:28,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1100410890, now seen corresponding path program 1 times [2024-10-11 08:11:28,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:28,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274194692] [2024-10-11 08:11:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:28,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274194692] [2024-10-11 08:11:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274194692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:28,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 08:11:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957140321] [2024-10-11 08:11:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:28,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:11:28,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:11:28,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:28,763 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10-11 08:11:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:29,273 INFO L93 Difference]: Finished difference Result 426 states and 620 transitions. [2024-10-11 08:11:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 08:11:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 170 [2024-10-11 08:11:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:29,275 INFO L225 Difference]: With dead ends: 426 [2024-10-11 08:11:29,275 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 08:11:29,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:11:29,276 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 184 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:29,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 580 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 08:11:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 08:11:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 242. [2024-10-11 08:11:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 199 states have (on average 1.3869346733668342) internal successors, (276), 201 states have internal predecessors, (276), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:11:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2024-10-11 08:11:29,298 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 170 [2024-10-11 08:11:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:29,298 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2024-10-11 08:11:29,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-10-11 08:11:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2024-10-11 08:11:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:11:29,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:29,300 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] [2024-10-11 08:11:29,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:11:29,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 476169631, now seen corresponding path program 1 times [2024-10-11 08:11:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111419865] [2024-10-11 08:11:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:11:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111419865] [2024-10-11 08:11:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111419865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:11:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513422124] [2024-10-11 08:11:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:29,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:29,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:11:29,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:11:29,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:11:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:29,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:11:29,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:11:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 361 proven. 75 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-10-11 08:11:29,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:11:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:11:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513422124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:11:30,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:11:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 08:11:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526070437] [2024-10-11 08:11:30,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:11:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 08:11:30,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 08:11:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 08:11:30,094 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) [2024-10-11 08:11:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:30,292 INFO L93 Difference]: Finished difference Result 505 states and 724 transitions. [2024-10-11 08:11:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 08:11:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) Word has length 170 [2024-10-11 08:11:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:30,295 INFO L225 Difference]: With dead ends: 505 [2024-10-11 08:11:30,295 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 08:11:30,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-10-11 08:11:30,298 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 201 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:30,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 192 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:11:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 08:11:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-10-11 08:11:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 214 states have (on average 1.341121495327103) internal successors, (287), 216 states have internal predecessors, (287), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 08:11:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2024-10-11 08:11:30,315 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 365 transitions. Word has length 170 [2024-10-11 08:11:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:30,315 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 365 transitions. [2024-10-11 08:11:30,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (76), 3 states have call predecessors, (76), 5 states have return successors, (77), 5 states have call predecessors, (77), 6 states have call successors, (77) [2024-10-11 08:11:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 365 transitions. [2024-10-11 08:11:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:11:30,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:30,319 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] [2024-10-11 08:11:30,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:11:30,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:30,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:30,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1112178271, now seen corresponding path program 1 times [2024-10-11 08:11:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505945960] [2024-10-11 08:11:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:11:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95040981] [2024-10-11 08:11:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:30,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:11:30,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:11:30,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:11:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:30,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 08:11:30,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:11:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 369 proven. 63 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-10-11 08:11:30,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:11:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 08:11:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:31,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505945960] [2024-10-11 08:11:31,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:11:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95040981] [2024-10-11 08:11:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95040981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:11:31,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:11:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 08:11:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906501498] [2024-10-11 08:11:31,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:11:31,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 08:11:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 08:11:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 08:11:31,233 INFO L87 Difference]: Start difference. First operand 262 states and 365 transitions. Second operand has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-10-11 08:11:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:32,072 INFO L93 Difference]: Finished difference Result 656 states and 881 transitions. [2024-10-11 08:11:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 08:11:32,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 170 [2024-10-11 08:11:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:32,075 INFO L225 Difference]: With dead ends: 656 [2024-10-11 08:11:32,075 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 08:11:32,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-10-11 08:11:32,076 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 219 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:32,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 793 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 08:11:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 08:11:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 252. [2024-10-11 08:11:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 206 states have (on average 1.325242718446602) internal successors, (273), 207 states have internal predecessors, (273), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:11:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 347 transitions. [2024-10-11 08:11:32,091 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 347 transitions. Word has length 170 [2024-10-11 08:11:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 347 transitions. [2024-10-11 08:11:32,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.9375) internal successors, (79), 16 states have internal predecessors, (79), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-10-11 08:11:32,092 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 347 transitions. [2024-10-11 08:11:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:11:32,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:32,093 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] [2024-10-11 08:11:32,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:11:32,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:32,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:32,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash 282762440, now seen corresponding path program 1 times [2024-10-11 08:11:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721086129] [2024-10-11 08:11:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721086129] [2024-10-11 08:11:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721086129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 08:11:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684694631] [2024-10-11 08:11:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:11:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:11:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:11:32,600 INFO L87 Difference]: Start difference. First operand 252 states and 347 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-10-11 08:11:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:33,057 INFO L93 Difference]: Finished difference Result 734 states and 991 transitions. [2024-10-11 08:11:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:11:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 170 [2024-10-11 08:11:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:33,060 INFO L225 Difference]: With dead ends: 734 [2024-10-11 08:11:33,060 INFO L226 Difference]: Without dead ends: 483 [2024-10-11 08:11:33,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:33,061 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 164 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:33,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 551 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:11:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-11 08:11:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 259. [2024-10-11 08:11:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 213 states have (on average 1.3286384976525822) internal successors, (283), 214 states have internal predecessors, (283), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:11:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 357 transitions. [2024-10-11 08:11:33,080 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 357 transitions. Word has length 170 [2024-10-11 08:11:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:33,081 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 357 transitions. [2024-10-11 08:11:33,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-10-11 08:11:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 357 transitions. [2024-10-11 08:11:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:11:33,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:33,083 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:11:33,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 08:11:33,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:33,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1536800144, now seen corresponding path program 1 times [2024-10-11 08:11:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:33,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008431629] [2024-10-11 08:11:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:11:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:11:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:11:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:11:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:11:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:11:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:11:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:11:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 08:11:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:11:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:11:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:11:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:11:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:11:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:11:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:11:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:11:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:11:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:11:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:11:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:11:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:11:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:11:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:11:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:11:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:11:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 08:11:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:11:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008431629] [2024-10-11 08:11:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008431629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 08:11:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531313690] [2024-10-11 08:11:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 08:11:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:11:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 08:11:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 08:11:33,527 INFO L87 Difference]: Start difference. First operand 259 states and 357 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:11:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:34,227 INFO L93 Difference]: Finished difference Result 782 states and 1076 transitions. [2024-10-11 08:11:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 08:11:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 08:11:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:34,231 INFO L225 Difference]: With dead ends: 782 [2024-10-11 08:11:34,231 INFO L226 Difference]: Without dead ends: 524 [2024-10-11 08:11:34,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:11:34,232 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 184 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:34,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 839 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:11:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-11 08:11:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 436. [2024-10-11 08:11:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 345 states have (on average 1.298550724637681) internal successors, (448), 347 states have internal predecessors, (448), 74 states have call successors, (74), 16 states have call predecessors, (74), 16 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 08:11:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 596 transitions. [2024-10-11 08:11:34,272 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 596 transitions. Word has length 171 [2024-10-11 08:11:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 596 transitions. [2024-10-11 08:11:34,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 08:11:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 596 transitions. [2024-10-11 08:11:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:11:34,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:34,274 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:11:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 08:11:34,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash -495958016, now seen corresponding path program 1 times [2024-10-11 08:11:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:11:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455445016] [2024-10-11 08:11:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:11:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:11:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250746325] [2024-10-11 08:11:34,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:34,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:11:34,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:11:34,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:11:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:11:34,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:11:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:11:34,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:11:34,591 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:11:34,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:11:34,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:11:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:11:34,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:11:34,905 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:11:34,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:11:34 BoogieIcfgContainer [2024-10-11 08:11:34,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:11:34,908 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:11:34,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:11:34,908 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:11:34,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:18" (3/4) ... [2024-10-11 08:11:34,910 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:11:34,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:11:34,911 INFO L158 Benchmark]: Toolchain (without parser) took 17381.66ms. Allocated memory was 159.4MB in the beginning and 476.1MB in the end (delta: 316.7MB). Free memory was 85.9MB in the beginning and 224.5MB in the end (delta: -138.6MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,911 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:11:34,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.91ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 70.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.87ms. Allocated memory is still 159.4MB. Free memory was 70.1MB in the beginning and 66.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,912 INFO L158 Benchmark]: Boogie Preprocessor took 43.77ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 63.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,912 INFO L158 Benchmark]: RCFGBuilder took 506.37ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 63.2MB in the beginning and 209.8MB in the end (delta: -146.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,912 INFO L158 Benchmark]: TraceAbstraction took 16439.53ms. Allocated memory was 262.1MB in the beginning and 476.1MB in the end (delta: 213.9MB). Free memory was 209.8MB in the beginning and 224.5MB in the end (delta: -14.7MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. [2024-10-11 08:11:34,912 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 476.1MB. Free memory is still 224.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:11:34,913 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.15ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 109.0MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.91ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 70.1MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.87ms. Allocated memory is still 159.4MB. Free memory was 70.1MB in the beginning and 66.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.77ms. Allocated memory is still 159.4MB. Free memory was 66.8MB in the beginning and 63.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 506.37ms. Allocated memory was 159.4MB in the beginning and 262.1MB in the end (delta: 102.8MB). Free memory was 63.2MB in the beginning and 209.8MB in the end (delta: -146.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16439.53ms. Allocated memory was 262.1MB in the beginning and 476.1MB in the end (delta: 213.9MB). Free memory was 209.8MB in the beginning and 224.5MB in the end (delta: -14.7MB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 476.1MB. Free memory is still 224.5MB. 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 someBinaryDOUBLEComparisonOperation at line 158, overapproximation of shiftLeft at line 158. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 99999999.01; [L44] float var_1_27 = 999999999.5; [L45] unsigned char var_1_28 = 2; [L46] unsigned char var_1_29 = 0; [L47] signed char var_1_30 = 5; [L48] signed char var_1_31 = 25; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L153] last_1_var_1_10 = var_1_10 [L154] last_1_var_1_12 = var_1_12 [L155] last_1_var_1_13 = var_1_13 [L165] RET updateLastVariables() [L166] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] var_1_5 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] var_1_6 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L119] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] var_1_7 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L124] var_1_8 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L125] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L126] var_1_9 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L127] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L128] var_1_11 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L129] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L130] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L130] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L131] var_1_15 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L132] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L133] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L133] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L134] var_1_20 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L135] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L136] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L136] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L137] var_1_21 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L138] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L139] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L140] var_1_22 = __VERIFIER_nondet_ulong() [L141] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L141] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L142] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L143] var_1_24 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L144] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L145] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L146] var_1_26 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L147] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L148] var_1_31 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L149] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L150] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L150] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L166] RET updateVariables() [L167] CALL step() [L55] COND TRUE var_1_20 || var_1_21 [L56] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_26 [L61] var_1_28 = 16 [L62] var_1_29 = 0 [L63] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L64] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L65] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L67] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L68] COND TRUE var_1_6 <= stepLocal_2 [L69] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L73] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L73] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L80] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L82] var_1_18 = var_1_3 [L83] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L84] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L85] COND FALSE !((- var_1_9) <= var_1_8) [L98] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L100] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L101] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L101] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L102] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L158-L159] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=254, var_1_18=0, var_1_19=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1458 mSDsluCounter, 5602 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3922 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3170 IncrementalHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 1680 mSDtfsCounter, 3170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1386 GetRequests, 1297 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=12, InterpolantAutomatonStates: 88, 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, 12 MinimizatonAttempts, 827 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 2709 NumberOfCodeBlocks, 2709 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2522 ConstructedInterpolants, 0 QuantifiedInterpolants, 10718 SizeOfPredicates, 9 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 19149/19500 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-10-11 08:11:34,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:11:37,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:11:37,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:11:37,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:11:37,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:11:37,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:11:37,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:11:37,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:11:37,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:11:37,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:11:37,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:11:37,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:11:37,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:11:37,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:11:37,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:11:37,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:11:37,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:11:37,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:11:37,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:11:37,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:11:37,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:11:37,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:11:37,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:11:37,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:11:37,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:11:37,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:11:37,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:11:37,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:11:37,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:11:37,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:11:37,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:11:37,290 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:11:37,290 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:11:37,290 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:11:37,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:11:37,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:11:37,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:11:37,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:11:37,293 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:11:37,293 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-clean/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-clean/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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-10-11 08:11:37,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:11:37,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:11:37,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:11:37,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:11:37,630 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:11:37,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:39,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:11:39,377 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:11:39,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:39,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c60ed709/93a121f4f2f1423aa87f2779790e8942/FLAG29c8c4d8a [2024-10-11 08:11:39,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c60ed709/93a121f4f2f1423aa87f2779790e8942 [2024-10-11 08:11:39,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:11:39,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:11:39,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:11:39,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:11:39,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:11:39,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:39" (1/1) ... [2024-10-11 08:11:39,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e37a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:39, skipping insertion in model container [2024-10-11 08:11:39,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:11:39" (1/1) ... [2024-10-11 08:11:39,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:11:39,923 WARN L248 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_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-10-11 08:11:39,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:11:39,981 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:11:39,991 WARN L248 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_fillercodesize_ps-cn-10_file-9.i[914,927] [2024-10-11 08:11:40,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:11:40,028 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:11:40,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40 WrapperNode [2024-10-11 08:11:40,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:11:40,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:11:40,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:11:40,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:11:40,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,078 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-11 08:11:40,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:11:40,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:11:40,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:11:40,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:11:40,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,105 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-10-11 08:11:40,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:11:40,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:11:40,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:11:40,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:11:40,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (1/1) ... [2024-10-11 08:11:40,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:11:40,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:11:40,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:11:40,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:11:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:11:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:11:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:11:40,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:11:40,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:11:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:11:40,293 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:11:40,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:11:40,773 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:11:40,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:11:40,821 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:11:40,823 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:11:40,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:40 BoogieIcfgContainer [2024-10-11 08:11:40,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:11:40,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:11:40,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:11:40,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:11:40,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:11:39" (1/3) ... [2024-10-11 08:11:40,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699035e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:40, skipping insertion in model container [2024-10-11 08:11:40,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:11:40" (2/3) ... [2024-10-11 08:11:40,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699035e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:11:40, skipping insertion in model container [2024-10-11 08:11:40,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:11:40" (3/3) ... [2024-10-11 08:11:40,832 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-10-11 08:11:40,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:11:40,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:11:40,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:11:40,935 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;@564d3d84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:11:40,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:11:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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-10-11 08:11:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 08:11:40,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:40,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] [2024-10-11 08:11:40,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:40,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 923025813, now seen corresponding path program 1 times [2024-10-11 08:11:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:11:40,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239539788] [2024-10-11 08:11:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:40,975 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-10-11 08:11:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:11:40,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 08:11:40,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:11:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:41,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:11:41,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:11:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-11 08:11:41,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:11:41,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:11:41,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239539788] [2024-10-11 08:11:41,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239539788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:11:41,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:11:41,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:11:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187440514] [2024-10-11 08:11:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:11:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:11:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:11:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:11:41,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:11:41,312 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-10-11 08:11:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:11:41,394 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-11 08:11:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:11:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 159 [2024-10-11 08:11:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:11:41,407 INFO L225 Difference]: With dead ends: 133 [2024-10-11 08:11:41,407 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 08:11:41,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-10-11 08:11:41,413 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:11:41,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:11:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 08:11:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 08:11:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-10-11 08:11:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2024-10-11 08:11:41,451 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 159 [2024-10-11 08:11:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:11:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2024-10-11 08:11:41,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-10-11 08:11:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2024-10-11 08:11:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 08:11:41,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:11:41,458 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] [2024-10-11 08:11:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:11:41,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 08:11:41,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:11:41,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:11:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2081813821, now seen corresponding path program 1 times [2024-10-11 08:11:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:11:41,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731047084] [2024-10-11 08:11:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:11:41,664 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-10-11 08:11:41,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:11:41,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 08:11:41,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 08:11:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:11:41,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 08:11:41,903 INFO L278 TraceCheckSpWp]: Computing forward predicates...