./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:06:29,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:06:29,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:06:29,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:06:29,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:06:29,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:06:29,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:06:29,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:06:29,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:06:29,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:06:29,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:06:29,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:06:29,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:06:29,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:06:29,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:06:29,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:06:29,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:06:29,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:06:29,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:06:29,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:06:29,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:06:29,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:06:29,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:06:29,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:06:29,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:06:29,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:06:29,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:06:29,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:06:29,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:06:29,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:06:29,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:06:29,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:06:29,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:06:29,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:06:29,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:06:29,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:06:29,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:06:29,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:06:29,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:06:29,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:06:29,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:06:29,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:06:29,689 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2024-11-10 07:06:29,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:06:29,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:06:29,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:06:29,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:06:29,985 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:06:29,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:06:31,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:06:31,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:06:31,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:06:31,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee3022ed/ff8dcc7a5000458a84e1ff08edfbdbfb/FLAGa41b40558 [2024-11-10 07:06:32,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee3022ed/ff8dcc7a5000458a84e1ff08edfbdbfb [2024-11-10 07:06:32,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:06:32,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:06:32,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:06:32,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:06:32,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:06:32,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74678c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32, skipping insertion in model container [2024-11-10 07:06:32,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:06:32,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-10 07:06:32,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:06:32,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:06:32,477 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-10 07:06:32,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:06:32,565 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:06:32,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32 WrapperNode [2024-11-10 07:06:32,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:06:32,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:06:32,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:06:32,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:06:32,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,669 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-10 07:06:32,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:06:32,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:06:32,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:06:32,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:06:32,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:06:32,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:06:32,767 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:06:32,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:06:32,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:06:32,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (1/1) ... [2024-11-10 07:06:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:06:32,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:32,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:06:32,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:06:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:06:32,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:06:32,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:06:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:06:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:06:32,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:06:32,970 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:06:32,974 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:06:33,407 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2024-11-10 07:06:33,460 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 07:06:33,463 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:06:33,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:06:33,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:06:33,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:06:33 BoogieIcfgContainer [2024-11-10 07:06:33,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:06:33,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:06:33,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:06:33,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:06:33,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:06:32" (1/3) ... [2024-11-10 07:06:33,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548645df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:06:33, skipping insertion in model container [2024-11-10 07:06:33,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:32" (2/3) ... [2024-11-10 07:06:33,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548645df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:06:33, skipping insertion in model container [2024-11-10 07:06:33,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:06:33" (3/3) ... [2024-11-10 07:06:33,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:06:33,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:06:33,527 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:06:33,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:06:33,602 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;@659ca084, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:06:33,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:06:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:06:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 07:06:33,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:33,624 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:33,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:33,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1600916035, now seen corresponding path program 1 times [2024-11-10 07:06:33,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:33,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609161059] [2024-11-10 07:06:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 07:06:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609161059] [2024-11-10 07:06:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609161059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:34,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:06:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851868673] [2024-11-10 07:06:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:34,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:06:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:06:34,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:06:34,373 INFO L87 Difference]: Start difference. First operand has 111 states, 80 states have (on average 1.4875) internal successors, (119), 81 states have internal predecessors, (119), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 07:06:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:34,436 INFO L93 Difference]: Finished difference Result 218 states and 374 transitions. [2024-11-10 07:06:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:06:34,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-10 07:06:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:34,451 INFO L225 Difference]: With dead ends: 218 [2024-11-10 07:06:34,451 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 07:06:34,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:06:34,460 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:34,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:06:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 07:06:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-10 07:06:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:06:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2024-11-10 07:06:34,509 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 183 [2024-11-10 07:06:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:34,510 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2024-11-10 07:06:34,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 07:06:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2024-11-10 07:06:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 07:06:34,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:34,516 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:06:34,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:34,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash 603997857, now seen corresponding path program 1 times [2024-11-10 07:06:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505226099] [2024-11-10 07:06:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 07:06:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505226099] [2024-11-10 07:06:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505226099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:35,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:35,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:06:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272227337] [2024-11-10 07:06:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:35,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:06:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:35,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:06:35,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:35,408 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:35,762 INFO L93 Difference]: Finished difference Result 315 states and 493 transitions. [2024-11-10 07:06:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:06:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-10 07:06:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:35,767 INFO L225 Difference]: With dead ends: 315 [2024-11-10 07:06:35,768 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 07:06:35,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:06:35,773 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 122 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:35,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 548 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:06:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 07:06:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2024-11-10 07:06:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 107 states have internal predecessors, (149), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 07:06:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2024-11-10 07:06:35,826 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 183 [2024-11-10 07:06:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:35,828 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2024-11-10 07:06:35,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2024-11-10 07:06:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 07:06:35,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:35,838 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:35,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:06:35,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:35,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1448277283, now seen corresponding path program 1 times [2024-11-10 07:06:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:35,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290528128] [2024-11-10 07:06:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:35,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 07:06:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290528128] [2024-11-10 07:06:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290528128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:06:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520293276] [2024-11-10 07:06:36,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:06:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:36,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:06:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:36,533 INFO L87 Difference]: Start difference. First operand 166 states and 261 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:37,035 INFO L93 Difference]: Finished difference Result 422 states and 652 transitions. [2024-11-10 07:06:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:06:37,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-10 07:06:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:37,040 INFO L225 Difference]: With dead ends: 422 [2024-11-10 07:06:37,040 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 07:06:37,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:37,045 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 255 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:37,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 406 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:06:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 07:06:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 308. [2024-11-10 07:06:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 86 states have call successors, (86), 5 states have call predecessors, (86), 5 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-10 07:06:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 473 transitions. [2024-11-10 07:06:37,118 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 473 transitions. Word has length 184 [2024-11-10 07:06:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:37,120 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 473 transitions. [2024-11-10 07:06:37,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 473 transitions. [2024-11-10 07:06:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 07:06:37,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:37,126 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:37,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:06:37,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:37,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1154874276, now seen corresponding path program 1 times [2024-11-10 07:06:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:37,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909073497] [2024-11-10 07:06:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 07:06:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909073497] [2024-11-10 07:06:37,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909073497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:37,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:37,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:06:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882829217] [2024-11-10 07:06:37,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:37,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:06:37,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:37,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:06:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:37,980 INFO L87 Difference]: Start difference. First operand 308 states and 473 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:38,220 INFO L93 Difference]: Finished difference Result 554 states and 847 transitions. [2024-11-10 07:06:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:06:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-10 07:06:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:38,226 INFO L225 Difference]: With dead ends: 554 [2024-11-10 07:06:38,226 INFO L226 Difference]: Without dead ends: 316 [2024-11-10 07:06:38,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:06:38,228 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 197 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:38,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 565 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:06:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-10 07:06:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-11-10 07:06:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 219 states have (on average 1.3789954337899544) internal successors, (302), 220 states have internal predecessors, (302), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-10 07:06:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2024-11-10 07:06:38,275 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 184 [2024-11-10 07:06:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2024-11-10 07:06:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2024-11-10 07:06:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 07:06:38,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:38,279 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:38,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:06:38,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:38,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash -775652229, now seen corresponding path program 1 times [2024-11-10 07:06:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:38,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563068858] [2024-11-10 07:06:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 07:06:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:38,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563068858] [2024-11-10 07:06:38,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563068858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:06:38,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100109754] [2024-11-10 07:06:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:38,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:38,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:06:38,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:06:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:38,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 07:06:38,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:06:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-10 07:06:39,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:06:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 07:06:39,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100109754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:06:39,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:06:39,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-10 07:06:39,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220539859] [2024-11-10 07:06:39,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:06:39,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:06:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:06:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:06:39,506 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-10 07:06:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:39,853 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2024-11-10 07:06:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:06:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 185 [2024-11-10 07:06:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:39,858 INFO L225 Difference]: With dead ends: 578 [2024-11-10 07:06:39,858 INFO L226 Difference]: Without dead ends: 334 [2024-11-10 07:06:39,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:06:39,860 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 175 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:39,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 468 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:06:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-10 07:06:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2024-11-10 07:06:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 214 states have (on average 1.308411214953271) internal successors, (280), 216 states have internal predecessors, (280), 86 states have call successors, (86), 9 states have call predecessors, (86), 9 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-10 07:06:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 452 transitions. [2024-11-10 07:06:39,902 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 452 transitions. Word has length 185 [2024-11-10 07:06:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 452 transitions. [2024-11-10 07:06:39,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-11-10 07:06:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 452 transitions. [2024-11-10 07:06:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 07:06:39,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:39,905 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:39,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:06:40,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:40,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:40,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1028243549, now seen corresponding path program 1 times [2024-11-10 07:06:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:40,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647661924] [2024-11-10 07:06:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 07:06:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647661924] [2024-11-10 07:06:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647661924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:06:40,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613564505] [2024-11-10 07:06:40,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:40,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:06:40,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:06:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:40,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 07:06:40,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:06:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-10 07:06:40,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:06:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 07:06:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613564505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:06:41,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:06:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 07:06:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41119190] [2024-11-10 07:06:41,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:06:41,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:06:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:06:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:06:41,175 INFO L87 Difference]: Start difference. First operand 310 states and 452 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 07:06:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:41,748 INFO L93 Difference]: Finished difference Result 595 states and 852 transitions. [2024-11-10 07:06:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 07:06:41,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 186 [2024-11-10 07:06:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:41,752 INFO L225 Difference]: With dead ends: 595 [2024-11-10 07:06:41,753 INFO L226 Difference]: Without dead ends: 345 [2024-11-10 07:06:41,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:06:41,755 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 590 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:41,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 465 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:06:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-10 07:06:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 322. [2024-11-10 07:06:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 225 states have internal predecessors, (287), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-10 07:06:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 459 transitions. [2024-11-10 07:06:41,805 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 459 transitions. Word has length 186 [2024-11-10 07:06:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:41,806 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 459 transitions. [2024-11-10 07:06:41,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 07:06:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 459 transitions. [2024-11-10 07:06:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 07:06:41,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:41,809 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:41,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:06:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 07:06:42,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:42,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2021959266, now seen corresponding path program 1 times [2024-11-10 07:06:42,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:42,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494659746] [2024-11-10 07:06:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:42,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 27 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2024-11-10 07:06:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494659746] [2024-11-10 07:06:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494659746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:06:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205847423] [2024-11-10 07:06:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:42,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:42,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:06:42,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:06:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:43,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:06:43,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:06:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 599 proven. 27 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-10 07:06:43,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:06:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 30 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-11-10 07:06:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205847423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:06:43,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:06:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-10 07:06:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508417879] [2024-11-10 07:06:43,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:06:43,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 07:06:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 07:06:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:06:43,655 INFO L87 Difference]: Start difference. First operand 322 states and 459 transitions. Second operand has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-10 07:06:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:44,917 INFO L93 Difference]: Finished difference Result 753 states and 1046 transitions. [2024-11-10 07:06:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 07:06:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 186 [2024-11-10 07:06:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:44,924 INFO L225 Difference]: With dead ends: 753 [2024-11-10 07:06:44,925 INFO L226 Difference]: Without dead ends: 495 [2024-11-10 07:06:44,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 422 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 07:06:44,927 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 825 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:44,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 780 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 07:06:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-10 07:06:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 452. [2024-11-10 07:06:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 316 states have (on average 1.2753164556962024) internal successors, (403), 318 states have internal predecessors, (403), 114 states have call successors, (114), 21 states have call predecessors, (114), 21 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-10 07:06:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 631 transitions. [2024-11-10 07:06:44,996 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 631 transitions. Word has length 186 [2024-11-10 07:06:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:44,997 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 631 transitions. [2024-11-10 07:06:44,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.733333333333333) internal successors, (71), 15 states have internal predecessors, (71), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-10 07:06:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 631 transitions. [2024-11-10 07:06:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 07:06:45,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:45,001 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:45,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:06:45,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:45,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:45,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1216398163, now seen corresponding path program 1 times [2024-11-10 07:06:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700980181] [2024-11-10 07:06:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:45,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:06:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:06:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:06:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:06:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:06:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:06:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:06:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:06:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 07:06:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:06:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:06:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:06:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:06:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:06:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 07:06:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700980181] [2024-11-10 07:06:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700980181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:06:45,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969359948] [2024-11-10 07:06:45,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:06:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:06:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:06:45,764 INFO L87 Difference]: Start difference. First operand 452 states and 631 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:46,081 INFO L93 Difference]: Finished difference Result 936 states and 1313 transitions. [2024-11-10 07:06:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:06:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-10 07:06:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:46,089 INFO L225 Difference]: With dead ends: 936 [2024-11-10 07:06:46,089 INFO L226 Difference]: Without dead ends: 552 [2024-11-10 07:06:46,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:06:46,093 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 99 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:46,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 421 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:06:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-10 07:06:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 458. [2024-11-10 07:06:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 322 states have (on average 1.279503105590062) internal successors, (412), 323 states have internal predecessors, (412), 114 states have call successors, (114), 21 states have call predecessors, (114), 21 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-10 07:06:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 640 transitions. [2024-11-10 07:06:46,171 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 640 transitions. Word has length 187 [2024-11-10 07:06:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:46,172 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 640 transitions. [2024-11-10 07:06:46,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 07:06:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 640 transitions. [2024-11-10 07:06:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 07:06:46,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:46,175 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:46,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:06:46,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2023960337, now seen corresponding path program 1 times [2024-11-10 07:06:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:46,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763172373] [2024-11-10 07:06:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:06:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600424157] [2024-11-10 07:06:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:46,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:46,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:46,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:06:46,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 07:06:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:06:46,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:06:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:06:46,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:06:46,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:06:46,669 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:06:46,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 07:06:46,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:06:46,875 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:06:47,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:06:47,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:06:47 BoogieIcfgContainer [2024-11-10 07:06:47,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:06:47,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:06:47,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:06:47,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:06:47,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:06:33" (3/4) ... [2024-11-10 07:06:47,051 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:06:47,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:06:47,053 INFO L158 Benchmark]: Toolchain (without parser) took 14984.86ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 97.2MB in the beginning and 272.6MB in the end (delta: -175.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-10 07:06:47,053 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:06:47,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.38ms. Allocated memory is still 159.4MB. Free memory was 97.2MB in the beginning and 122.3MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 07:06:47,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.64ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 118.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:06:47,053 INFO L158 Benchmark]: Boogie Preprocessor took 95.73ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 113.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:06:47,054 INFO L158 Benchmark]: IcfgBuilder took 723.48ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 81.7MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 07:06:47,054 INFO L158 Benchmark]: TraceAbstraction took 13550.57ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 81.1MB in the beginning and 272.6MB in the end (delta: -191.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:06:47,054 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 346.0MB. Free memory is still 272.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:06:47,057 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.17ms. Allocated memory is still 100.7MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.38ms. Allocated memory is still 159.4MB. Free memory was 97.2MB in the beginning and 122.3MB in the end (delta: -25.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.64ms. Allocated memory is still 159.4MB. Free memory was 122.3MB in the beginning and 118.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.73ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 113.9MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 723.48ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 81.7MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13550.57ms. Allocated memory was 159.4MB in the beginning and 346.0MB in the end (delta: 186.6MB). Free memory was 81.1MB in the beginning and 272.6MB in the end (delta: -191.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 346.0MB. Free memory is still 272.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of bitwiseOr at line 201. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 47136; [L25] unsigned short int var_1_4 = 10; [L26] unsigned long int var_1_6 = 1660677957; [L27] unsigned long int var_1_7 = 128; [L28] float var_1_9 = 9.4; [L29] float var_1_12 = 16.2; [L30] float var_1_13 = 127.9; [L31] float var_1_14 = 15.5; [L32] unsigned long int var_1_15 = 100; [L33] signed char var_1_16 = 64; [L34] float var_1_17 = 9.7; [L35] signed char var_1_18 = -64; [L36] signed char var_1_19 = -4; [L37] unsigned short int var_1_20 = 64; [L38] unsigned short int var_1_21 = 1; [L39] signed char var_1_22 = 2; [L40] unsigned long int var_1_23 = 8; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 0; [L44] unsigned char var_1_27 = 0; [L45] unsigned char var_1_28 = 0; [L46] float last_1_var_1_9 = 9.4; [L47] float last_1_var_1_14 = 15.5; [L48] unsigned long int last_1_var_1_15 = 100; [L49] unsigned short int last_1_var_1_20 = 64; [L50] unsigned long int last_1_var_1_23 = 8; [L51] unsigned char last_1_var_1_24 = 0; VAL [isInitial=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] int k_loop; [L208] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L208] COND TRUE k_loop < 1 [L209] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_14 = var_1_14 [L195] last_1_var_1_15 = var_1_15 [L196] last_1_var_1_20 = var_1_20 [L197] last_1_var_1_23 = var_1_23 [L198] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L148] var_1_2 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L149] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L151] var_1_3 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L152] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L154] var_1_4 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L155] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L157] var_1_6 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L158] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L159] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L159] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L160] var_1_7 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L162] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L162] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L163] var_1_12 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L164] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L166] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L167] var_1_17 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L169] CALL assume_abort_if_not(var_1_17 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L169] RET assume_abort_if_not(var_1_17 != 0.0F) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L170] var_1_18 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L171] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L172] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L172] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L173] var_1_19 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L174] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L175] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L175] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L176] var_1_21 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L177] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L178] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L178] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L181] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L181] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L182] var_1_26 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L183] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L184] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L184] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L185] var_1_27 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L186] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L187] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L187] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L188] var_1_28 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L189] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L190] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L190] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L210] RET updateVariables() [L211] CALL step() [L55] unsigned long int stepLocal_0 = var_1_6 * last_1_var_1_23; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L56] COND FALSE !(\read(last_1_var_1_24)) [L63] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L65] COND TRUE last_1_var_1_14 >= (var_1_13 * last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L66] COND TRUE \read(var_1_2) [L67] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L80] COND FALSE !(var_1_24 && (var_1_20 < (3349670375u - var_1_4))) [L87] var_1_15 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L89] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L89] COND FALSE !(last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) [L96] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L98] unsigned short int stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L99] COND TRUE var_1_14 < (9999.6f + var_1_12) [L100] var_1_23 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L112] COND FALSE !((256.2 * var_1_14) < var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L117] COND FALSE !(var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) [L120] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L122] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L131] signed char stepLocal_2 = var_1_19; [L132] unsigned long int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_1=-3221225473, stepLocal_2=0, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L133] COND TRUE var_1_12 <= var_1_14 [L134] var_1_22 = var_1_19 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_1=-3221225473, stepLocal_2=0, stepLocal_3=-32769, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L211] RET step() [L212] CALL, EXPR property() [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR ((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3)))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201-L202] return (((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3))))) && ((last_1_var_1_14 >= (var_1_13 * last_1_var_1_9)) ? (var_1_2 ? (var_1_24 == ((unsigned char) var_1_25)) : (var_1_24 == ((unsigned char) (var_1_25 || var_1_26)))) : (var_1_25 ? (var_1_24 == ((unsigned char) (var_1_26 && var_1_27))) : ((last_1_var_1_15 == last_1_var_1_20) ? (var_1_24 == ((unsigned char) var_1_28)) : 1))) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=-32769, var_1_21=-32769, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2363 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2263 mSDsluCounter, 3818 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2563 mSDsCounter, 917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1392 IncrementalHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 917 mSolverCounterUnsat, 1255 mSDtfsCounter, 1392 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1682 GetRequests, 1591 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=8, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 242 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2413 NumberOfCodeBlocks, 2413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2578 ConstructedInterpolants, 0 QuantifiedInterpolants, 6429 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 20841/21168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:06:47,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:06:49,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:06:49,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:06:49,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:06:49,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:06:49,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:06:49,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:06:49,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:06:49,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:06:49,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:06:49,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:06:49,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:06:49,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:06:49,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:06:49,673 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:06:49,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:06:49,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:06:49,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:06:49,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:06:49,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:06:49,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:06:49,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:06:49,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:06:49,678 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:06:49,678 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:06:49,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:06:49,679 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:06:49,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:06:49,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:06:49,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:06:49,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:06:49,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:06:49,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:06:49,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:06:49,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:06:49,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:06:49,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:06:49,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:06:49,683 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:06:49,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:06:49,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:06:49,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:06:49,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:06:49,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:06:49,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2024-11-10 07:06:50,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:06:50,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:06:50,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:06:50,093 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:06:50,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:06:50,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:06:51,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:06:51,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:06:51,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:06:51,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4e0ca71/292cf13a533146a2a0721c08542cca10/FLAGaa7f79aeb [2024-11-10 07:06:51,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f4e0ca71/292cf13a533146a2a0721c08542cca10 [2024-11-10 07:06:51,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:06:51,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:06:51,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:06:51,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:06:51,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:06:51,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:51" (1/1) ... [2024-11-10 07:06:51,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cdc494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:51, skipping insertion in model container [2024-11-10 07:06:51,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:06:51" (1/1) ... [2024-11-10 07:06:51,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:06:52,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-10 07:06:52,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:06:52,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:06:52,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2024-11-10 07:06:52,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:06:52,363 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:06:52,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52 WrapperNode [2024-11-10 07:06:52,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:06:52,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:06:52,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:06:52,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:06:52,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,433 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-10 07:06:52,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:06:52,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:06:52,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:06:52,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:06:52,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:06:52,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:06:52,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:06:52,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:06:52,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:06:52,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (1/1) ... [2024-11-10 07:06:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:06:52,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:06:52,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:06:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:06:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:06:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:06:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:06:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:06:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:06:52,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:06:52,723 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:06:52,726 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:07:11,608 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:07:11,609 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:07:11,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:07:11,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:07:11,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:07:11 BoogieIcfgContainer [2024-11-10 07:07:11,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:07:11,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:07:11,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:07:11,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:07:11,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:06:51" (1/3) ... [2024-11-10 07:07:11,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54874fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:07:11, skipping insertion in model container [2024-11-10 07:07:11,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:06:52" (2/3) ... [2024-11-10 07:07:11,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54874fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:07:11, skipping insertion in model container [2024-11-10 07:07:11,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:07:11" (3/3) ... [2024-11-10 07:07:11,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2024-11-10 07:07:11,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:07:11,655 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:07:11,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:07:11,740 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;@1c6c6068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:07:11,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:07:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:07:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:07:11,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:07:11,762 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:07:11,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:07:11,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:07:11,767 INFO L85 PathProgramCache]: Analyzing trace with hash -814671387, now seen corresponding path program 1 times [2024-11-10 07:07:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:07:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029999562] [2024-11-10 07:07:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:07:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:07:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:07:11,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:07:11,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:07:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:07:12,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:07:12,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:07:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-10 07:07:12,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:07:12,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:07:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029999562] [2024-11-10 07:07:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029999562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:07:12,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:07:12,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:07:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714306486] [2024-11-10 07:07:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:07:12,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:07:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:07:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:07:12,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:07:12,833 INFO L87 Difference]: Start difference. First operand has 89 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 07:07:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:07:12,870 INFO L93 Difference]: Finished difference Result 174 states and 306 transitions. [2024-11-10 07:07:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:07:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-10 07:07:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:07:12,880 INFO L225 Difference]: With dead ends: 174 [2024-11-10 07:07:12,880 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 07:07:12,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:07:12,887 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:07:12,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:07:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 07:07:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 07:07:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 07:07:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 133 transitions. [2024-11-10 07:07:12,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 133 transitions. Word has length 178 [2024-11-10 07:07:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:07:12,943 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 133 transitions. [2024-11-10 07:07:12,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 07:07:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 133 transitions. [2024-11-10 07:07:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:07:12,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:07:12,948 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:07:12,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:07:13,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:07:13,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:07:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:07:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1402725689, now seen corresponding path program 1 times [2024-11-10 07:07:13,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:07:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890906341] [2024-11-10 07:07:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:07:13,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:07:13,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:07:13,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:07:13,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:07:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:07:13,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:07:13,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:07:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-10 07:07:15,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:07:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 07:07:17,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:07:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890906341] [2024-11-10 07:07:17,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890906341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:07:17,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:07:17,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 07:07:17,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587981172] [2024-11-10 07:07:17,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:07:17,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:07:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:07:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:07:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:07:17,348 INFO L87 Difference]: Start difference. First operand 84 states and 133 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 07:07:24,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:28,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:32,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:36,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:40,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:44,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:48,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:07:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:07:49,232 INFO L93 Difference]: Finished difference Result 261 states and 405 transitions. [2024-11-10 07:07:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 07:07:49,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 178 [2024-11-10 07:07:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:07:49,240 INFO L225 Difference]: With dead ends: 261 [2024-11-10 07:07:49,240 INFO L226 Difference]: Without dead ends: 180 [2024-11-10 07:07:49,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:07:49,245 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 466 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 282 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:07:49,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 311 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 198 Invalid, 7 Unknown, 0 Unchecked, 30.8s Time] [2024-11-10 07:07:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-10 07:07:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2024-11-10 07:07:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 107 states have internal predecessors, (146), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 07:07:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 258 transitions. [2024-11-10 07:07:49,300 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 258 transitions. Word has length 178 [2024-11-10 07:07:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:07:49,302 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 258 transitions. [2024-11-10 07:07:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 07:07:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 258 transitions. [2024-11-10 07:07:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:07:49,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:07:49,307 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:07:49,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:07:49,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:07:49,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:07:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:07:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1084787144, now seen corresponding path program 1 times [2024-11-10 07:07:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:07:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197196289] [2024-11-10 07:07:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:07:49,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:07:49,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:07:49,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:07:49,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 07:07:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:07:50,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 07:07:50,221 INFO L278 TraceCheckSpWp]: Computing forward predicates...