./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.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_codestructure_steplocals_file-35.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 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:31:21,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:31:21,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:31:21,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:31:21,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:31:21,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:31:21,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:31:21,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:31:21,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:31:21,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:31:21,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:31:21,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:31:21,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:31:21,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:31:21,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:31:21,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:31:21,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:31:21,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:31:21,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:31:21,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:31:21,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:31:21,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:31:21,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:31:21,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:31:21,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:31:21,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:31:21,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:31:21,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:31:21,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:31:21,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:31:21,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:31:21,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:31:21,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:31:21,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:31:21,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:31:21,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:31:21,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:31:21,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:31:21,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:31:21,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:31:21,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:31:21,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:31:21,829 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 -> 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba [2024-11-10 03:31:22,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:31:22,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:31:22,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:31:22,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:31:22,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:31:22,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2024-11-10 03:31:23,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:31:23,840 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:31:23,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2024-11-10 03:31:23,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3003a3c/cd18d1bfcb874f3e8e955da0bbbe701e/FLAG43717c753 [2024-11-10 03:31:24,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a3003a3c/cd18d1bfcb874f3e8e955da0bbbe701e [2024-11-10 03:31:24,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:31:24,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:31:24,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:31:24,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:31:24,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:31:24,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458989b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24, skipping insertion in model container [2024-11-10 03:31:24,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:31:24,451 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_codestructure_steplocals_file-35.i[917,930] [2024-11-10 03:31:24,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:31:24,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:31:24,533 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_codestructure_steplocals_file-35.i[917,930] [2024-11-10 03:31:24,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:31:24,598 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:31:24,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24 WrapperNode [2024-11-10 03:31:24,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:31:24,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:31:24,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:31:24,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:31:24,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,671 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-10 03:31:24,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:31:24,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:31:24,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:31:24,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:31:24,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,716 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 03:31:24,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:31:24,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:31:24,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:31:24,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:31:24,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (1/1) ... [2024-11-10 03:31:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:31:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:31:24,794 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 03:31:24,800 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 03:31:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:31:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:31:24,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:31:24,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:31:24,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:31:24,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:31:24,973 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:31:24,975 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:31:25,283 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2024-11-10 03:31:25,323 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:31:25,323 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:31:25,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:31:25,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:31:25,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:31:25 BoogieIcfgContainer [2024-11-10 03:31:25,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:31:25,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:31:25,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:31:25,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:31:25,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:31:24" (1/3) ... [2024-11-10 03:31:25,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb37176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:25, skipping insertion in model container [2024-11-10 03:31:25,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:24" (2/3) ... [2024-11-10 03:31:25,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb37176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:25, skipping insertion in model container [2024-11-10 03:31:25,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:31:25" (3/3) ... [2024-11-10 03:31:25,360 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-35.i [2024-11-10 03:31:25,380 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:31:25,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:31:25,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:31:25,465 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;@7227b730, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:31:25,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:31:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 57 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 03:31:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:31:25,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:31:25,482 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:25,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:31:25,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:31:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 108144169, now seen corresponding path program 1 times [2024-11-10 03:31:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:31:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006081304] [2024-11-10 03:31:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:31:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:31:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:31:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:31:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:31:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:31:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:31:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:31:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:31:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:31:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:31:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:31:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:31:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:31:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:31:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:31:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:31:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:31:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:31:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:31:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:25,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:31:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:31:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:31:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:31:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:31:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:31:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:31:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:31:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:31:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:31:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006081304] [2024-11-10 03:31:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006081304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:31:26,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:31:26,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:31:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434054169] [2024-11-10 03:31:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:31:26,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:31:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:31:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:31:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:31:26,121 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 57 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 03:31:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:31:26,181 INFO L93 Difference]: Finished difference Result 164 states and 274 transitions. [2024-11-10 03:31:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:31:26,184 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2024-11-10 03:31:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:31:26,194 INFO L225 Difference]: With dead ends: 164 [2024-11-10 03:31:26,194 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 03:31:26,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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 03:31:26,205 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:31:26,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:31:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 03:31:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-10 03:31:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 03:31:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-10 03:31:26,259 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 177 [2024-11-10 03:31:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:31:26,260 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-10 03:31:26,260 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 03:31:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-10 03:31:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:31:26,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:31:26,268 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:31:26,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:31:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:31:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1842121542, now seen corresponding path program 1 times [2024-11-10 03:31:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:31:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408754453] [2024-11-10 03:31:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:31:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:31:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:31:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:31:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:31:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:31:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:31:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:31:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:31:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:31:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:31:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:31:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:31:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:31:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:31:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:31:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:31:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:31:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:31:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:31:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:31:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:31:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:31:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:31:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:31:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:31:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:31:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:31:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:31:27,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:31:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408754453] [2024-11-10 03:31:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408754453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:31:27,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:31:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:31:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130861251] [2024-11-10 03:31:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:31:27,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:31:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:31:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:31:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:31:27,071 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:31:27,315 INFO L93 Difference]: Finished difference Result 211 states and 309 transitions. [2024-11-10 03:31:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:31:27,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 03:31:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:31:27,319 INFO L225 Difference]: With dead ends: 211 [2024-11-10 03:31:27,322 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 03:31:27,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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 03:31:27,324 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 74 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:31:27,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 262 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:31:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 03:31:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-11-10 03:31:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 86 states have internal predecessors, (107), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 03:31:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-11-10 03:31:27,358 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 177 [2024-11-10 03:31:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:31:27,359 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-11-10 03:31:27,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-11-10 03:31:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:31:27,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:31:27,362 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:31:27,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:31:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:31:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -945293945, now seen corresponding path program 1 times [2024-11-10 03:31:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:31:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623744373] [2024-11-10 03:31:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:31:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:31:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:31:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:31:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:31:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:31:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:31:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:31:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:31:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:31:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:31:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:31:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:31:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:31:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:31:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:31:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:31:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:31:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:31:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:31:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:31:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:31:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:31:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:31:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:31:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:31:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:31:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:31:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-10 03:31:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:31:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623744373] [2024-11-10 03:31:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623744373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200852208] [2024-11-10 03:31:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:29,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:31:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:31:29,969 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 03:31:29,971 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 03:31:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:30,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 03:31:30,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:31:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 940 proven. 162 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2024-11-10 03:31:33,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:31:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:31:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200852208] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:31:39,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 22] total 36 [2024-11-10 03:31:39,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558935573] [2024-11-10 03:31:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:31:39,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:31:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:31:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:31:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1004, Unknown=1, NotChecked=0, Total=1260 [2024-11-10 03:31:39,822 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:31:44,124 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2024-11-10 03:31:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:31:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 03:31:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:31:44,135 INFO L225 Difference]: With dead ends: 375 [2024-11-10 03:31:44,135 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 03:31:44,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 384 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=334, Invalid=1387, Unknown=1, NotChecked=0, Total=1722 [2024-11-10 03:31:44,139 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 249 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:31:44,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 516 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 03:31:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 03:31:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 143. [2024-11-10 03:31:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 100 states have internal predecessors, (127), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 03:31:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-11-10 03:31:44,169 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 177 [2024-11-10 03:31:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:31:44,169 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-11-10 03:31:44,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-11-10 03:31:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:31:44,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:31:44,173 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:44,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:31:44,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:31:44,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:31:44,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:31:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1552721992, now seen corresponding path program 1 times [2024-11-10 03:31:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:31:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629207464] [2024-11-10 03:31:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:31:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:31:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:31:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:31:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:31:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:31:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:31:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:31:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:31:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:31:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:31:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:31:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:31:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:31:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:31:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:31:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:31:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:31:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:31:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:31:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:31:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:31:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:31:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:31:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:31:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:31:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:31:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:31:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-10 03:31:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:31:46,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629207464] [2024-11-10 03:31:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629207464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019705662] [2024-11-10 03:31:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:31:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:31:46,471 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 03:31:46,473 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 03:31:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:46,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 03:31:46,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:31:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 563 proven. 72 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2024-11-10 03:31:48,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:31:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:31:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019705662] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:31:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 15] total 30 [2024-11-10 03:31:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161447966] [2024-11-10 03:31:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:31:50,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:31:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:31:50,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:31:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2024-11-10 03:31:50,925 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:31:52,357 INFO L93 Difference]: Finished difference Result 438 states and 623 transitions. [2024-11-10 03:31:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:31:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 03:31:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:31:52,364 INFO L225 Difference]: With dead ends: 438 [2024-11-10 03:31:52,364 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 03:31:52,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 03:31:52,366 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 283 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:31:52,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 696 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:31:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 03:31:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 144. [2024-11-10 03:31:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 03:31:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2024-11-10 03:31:52,384 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 177 [2024-11-10 03:31:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:31:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2024-11-10 03:31:52,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:31:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2024-11-10 03:31:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:31:52,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:31:52,392 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:31:52,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:31:52,592 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,SelfDestructingSolverStorable3 [2024-11-10 03:31:52,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:31:52,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:31:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -100822074, now seen corresponding path program 1 times [2024-11-10 03:31:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:31:52,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966942200] [2024-11-10 03:31:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:31:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:31:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:31:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:31:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:31:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:31:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:31:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:31:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:31:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:31:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:31:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:31:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:31:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:31:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:31:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:31:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:31:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:31:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:31:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:31:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:31:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:31:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:31:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:31:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:31:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:31:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:31:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:31:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-10 03:31:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:31:54,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966942200] [2024-11-10 03:31:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966942200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818524824] [2024-11-10 03:31:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:31:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:31:54,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:31:54,560 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 03:31:54,562 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 03:31:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:31:54,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 03:31:54,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:31:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 572 proven. 132 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2024-11-10 03:31:56,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:31:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:31:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818524824] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 03:31:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:31:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9, 18] total 34 [2024-11-10 03:31:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578268293] [2024-11-10 03:31:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:31:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:31:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:31:59,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:31:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 03:31:59,204 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:07,291 INFO L93 Difference]: Finished difference Result 403 states and 574 transitions. [2024-11-10 03:32:07,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:32:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 03:32:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:07,295 INFO L225 Difference]: With dead ends: 403 [2024-11-10 03:32:07,295 INFO L226 Difference]: Without dead ends: 262 [2024-11-10 03:32:07,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 388 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 03:32:07,297 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 317 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:07,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 686 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-10 03:32:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-10 03:32:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 149. [2024-11-10 03:32:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 106 states have internal predecessors, (136), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 03:32:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2024-11-10 03:32:07,315 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 177 [2024-11-10 03:32:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2024-11-10 03:32:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2024-11-10 03:32:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 03:32:07,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:07,319 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:07,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 03:32:07,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:07,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:07,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1897773433, now seen corresponding path program 1 times [2024-11-10 03:32:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:07,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343841019] [2024-11-10 03:32:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:32:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:32:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:32:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:32:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:32:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:32:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:32:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:32:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:32:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:32:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:32:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:32:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:32:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:32:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:32:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343841019] [2024-11-10 03:32:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343841019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:09,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:32:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878379347] [2024-11-10 03:32:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:32:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:32:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:32:09,413 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:10,082 INFO L93 Difference]: Finished difference Result 520 states and 756 transitions. [2024-11-10 03:32:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:32:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2024-11-10 03:32:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:10,087 INFO L225 Difference]: With dead ends: 520 [2024-11-10 03:32:10,087 INFO L226 Difference]: Without dead ends: 374 [2024-11-10 03:32:10,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:32:10,088 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 168 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:10,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 541 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:32:10,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-10 03:32:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 294. [2024-11-10 03:32:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 209 states have internal predecessors, (270), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:32:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-10 03:32:10,132 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 177 [2024-11-10 03:32:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:10,133 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-10 03:32:10,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-10 03:32:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 03:32:10,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:10,135 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:10,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:32:10,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:10,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1674400030, now seen corresponding path program 1 times [2024-11-10 03:32:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:10,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680563225] [2024-11-10 03:32:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:32:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:32:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:32:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:32:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:32:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:32:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:32:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:32:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:32:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:32:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:32:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:32:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:32:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:32:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:32:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680563225] [2024-11-10 03:32:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680563225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 03:32:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735790099] [2024-11-10 03:32:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 03:32:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 03:32:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:32:11,585 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:12,438 INFO L93 Difference]: Finished difference Result 724 states and 1047 transitions. [2024-11-10 03:32:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:32:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-10 03:32:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:12,442 INFO L225 Difference]: With dead ends: 724 [2024-11-10 03:32:12,442 INFO L226 Difference]: Without dead ends: 433 [2024-11-10 03:32:12,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:32:12,444 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 330 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:12,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 544 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:32:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-10 03:32:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 296. [2024-11-10 03:32:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 209 states have (on average 1.3110047846889952) internal successors, (274), 211 states have internal predecessors, (274), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:32:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 438 transitions. [2024-11-10 03:32:12,481 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 438 transitions. Word has length 178 [2024-11-10 03:32:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:12,482 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 438 transitions. [2024-11-10 03:32:12,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 438 transitions. [2024-11-10 03:32:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 03:32:12,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:12,484 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:32:12,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:12,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1380997023, now seen corresponding path program 1 times [2024-11-10 03:32:12,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306338476] [2024-11-10 03:32:12,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:32:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:32:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:32:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:32:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:32:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:32:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:32:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:32:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:32:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:32:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:32:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:32:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:32:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:32:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:32:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306338476] [2024-11-10 03:32:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306338476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:32:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551208829] [2024-11-10 03:32:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:32:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:32:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:32:14,001 INFO L87 Difference]: Start difference. First operand 296 states and 438 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:15,067 INFO L93 Difference]: Finished difference Result 750 states and 1086 transitions. [2024-11-10 03:32:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 03:32:15,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-10 03:32:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:15,073 INFO L225 Difference]: With dead ends: 750 [2024-11-10 03:32:15,073 INFO L226 Difference]: Without dead ends: 457 [2024-11-10 03:32:15,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-10 03:32:15,077 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 337 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:15,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 788 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:32:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-10 03:32:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 304. [2024-11-10 03:32:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 217 states have (on average 1.3179723502304148) internal successors, (286), 219 states have internal predecessors, (286), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:32:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 450 transitions. [2024-11-10 03:32:15,112 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 450 transitions. Word has length 178 [2024-11-10 03:32:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:15,113 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 450 transitions. [2024-11-10 03:32:15,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 450 transitions. [2024-11-10 03:32:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 03:32:15,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:15,116 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:15,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:32:15,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:15,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -346574504, now seen corresponding path program 1 times [2024-11-10 03:32:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781612589] [2024-11-10 03:32:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:32:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:32:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:32:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:32:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:32:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:32:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:32:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:32:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:32:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:32:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:32:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:32:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:32:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:32:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:32:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-10 03:32:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781612589] [2024-11-10 03:32:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781612589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233986580] [2024-11-10 03:32:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:16,465 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 03:32:16,466 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 03:32:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:16,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 03:32:16,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 716 proven. 33 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2024-11-10 03:32:17,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:32:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:18,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233986580] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:18,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:32:18,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 12] total 23 [2024-11-10 03:32:18,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89165864] [2024-11-10 03:32:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:18,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:32:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:18,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:32:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-10 03:32:18,672 INFO L87 Difference]: Start difference. First operand 304 states and 450 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:19,272 INFO L93 Difference]: Finished difference Result 843 states and 1223 transitions. [2024-11-10 03:32:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 03:32:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-10 03:32:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:19,277 INFO L225 Difference]: With dead ends: 843 [2024-11-10 03:32:19,277 INFO L226 Difference]: Without dead ends: 542 [2024-11-10 03:32:19,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2024-11-10 03:32:19,279 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 127 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:19,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 638 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:32:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-10 03:32:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 304. [2024-11-10 03:32:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 217 states have (on average 1.3179723502304148) internal successors, (286), 219 states have internal predecessors, (286), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-10 03:32:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 450 transitions. [2024-11-10 03:32:19,304 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 450 transitions. Word has length 178 [2024-11-10 03:32:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:19,304 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 450 transitions. [2024-11-10 03:32:19,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 450 transitions. [2024-11-10 03:32:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 03:32:19,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:19,306 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:19,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 03:32:19,506 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 03:32:19,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1136328735, now seen corresponding path program 1 times [2024-11-10 03:32:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:19,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624691732] [2024-11-10 03:32:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:32:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:32:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:32:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:32:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:32:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:32:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:32:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:32:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:32:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:32:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 03:32:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 03:32:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 03:32:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 03:32:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 03:32:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 03:32:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 03:32:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 03:32:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:19,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:19,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624691732] [2024-11-10 03:32:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624691732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:19,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:32:19,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990560578] [2024-11-10 03:32:19,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:19,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:32:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:19,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:32:19,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:32:19,810 INFO L87 Difference]: Start difference. First operand 304 states and 450 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:20,053 INFO L93 Difference]: Finished difference Result 544 states and 792 transitions. [2024-11-10 03:32:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:32:20,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-10 03:32:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:20,057 INFO L225 Difference]: With dead ends: 544 [2024-11-10 03:32:20,057 INFO L226 Difference]: Without dead ends: 395 [2024-11-10 03:32:20,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:32:20,059 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 176 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:20,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 416 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:32:20,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-10 03:32:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 228. [2024-11-10 03:32:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 169 states have internal predecessors, (224), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 03:32:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 332 transitions. [2024-11-10 03:32:20,080 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 332 transitions. Word has length 178 [2024-11-10 03:32:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 332 transitions. [2024-11-10 03:32:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 332 transitions. [2024-11-10 03:32:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 03:32:20,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:20,082 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:20,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:32:20,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:20,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash -671125728, now seen corresponding path program 1 times [2024-11-10 03:32:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:20,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477044528] [2024-11-10 03:32:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:32:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681706624] [2024-11-10 03:32:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:20,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:20,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:20,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:20,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 03:32:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:32:20,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:32:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:32:20,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:32:20,400 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:32:20,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:32:20,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 03:32:20,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 03:32:20,607 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:32:20,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:32:20,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:32:20 BoogieIcfgContainer [2024-11-10 03:32:20,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:32:20,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:32:20,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:32:20,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:32:20,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:31:25" (3/4) ... [2024-11-10 03:32:20,719 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:32:20,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:32:20,720 INFO L158 Benchmark]: Toolchain (without parser) took 56500.02ms. Allocated memory was 155.2MB in the beginning and 574.6MB in the end (delta: 419.4MB). Free memory was 99.0MB in the beginning and 398.0MB in the end (delta: -299.0MB). Peak memory consumption was 122.0MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,721 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 155.2MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:32:20,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.16ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 82.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.84ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 79.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,721 INFO L158 Benchmark]: Boogie Preprocessor took 64.42ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 75.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,722 INFO L158 Benchmark]: IcfgBuilder took 613.08ms. Allocated memory is still 155.2MB. Free memory was 75.9MB in the beginning and 53.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,722 INFO L158 Benchmark]: TraceAbstraction took 55360.27ms. Allocated memory was 155.2MB in the beginning and 574.6MB in the end (delta: 419.4MB). Free memory was 52.9MB in the beginning and 399.1MB in the end (delta: -346.2MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,723 INFO L158 Benchmark]: Witness Printer took 5.96ms. Allocated memory is still 574.6MB. Free memory was 399.1MB in the beginning and 398.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:32:20,724 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.27ms. Allocated memory is still 155.2MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.16ms. Allocated memory is still 155.2MB. Free memory was 98.4MB in the beginning and 82.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.84ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 79.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.42ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 75.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 613.08ms. Allocated memory is still 155.2MB. Free memory was 75.9MB in the beginning and 53.8MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 55360.27ms. Allocated memory was 155.2MB in the beginning and 574.6MB in the end (delta: 419.4MB). Free memory was 52.9MB in the beginning and 399.1MB in the end (delta: -346.2MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Witness Printer took 5.96ms. Allocated memory is still 574.6MB. Free memory was 399.1MB in the beginning and 398.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someUnaryFLOAToperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 25; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = -5; [L30] double var_1_9 = 999.625; [L31] double var_1_10 = 5.06; [L32] unsigned short int var_1_11 = 5; [L33] signed short int var_1_12 = 2; [L34] signed long int var_1_13 = -256; [L35] double var_1_14 = 127.75; [L36] double var_1_15 = 9.75; [L37] float var_1_16 = 32.8; [L38] float var_1_17 = 32.5; [L39] float var_1_18 = 1.75; [L40] float var_1_19 = 1000000000000000.4; [L41] float var_1_20 = 0.875; [L42] unsigned char var_1_21 = 0; [L43] unsigned char var_1_22 = 0; [L44] signed short int var_1_23 = 64; [L45] signed short int var_1_24 = 25; [L46] signed short int var_1_25 = 0; VAL [isInitial=0, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L102] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L103] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L103] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L104] var_1_7 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L105] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L106] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L106] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L107] var_1_8 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_8 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L108] RET assume_abort_if_not(var_1_8 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L109] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L109] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L111] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L114] var_1_11 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L117] var_1_15 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L118] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L119] var_1_17 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L120] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L121] var_1_18 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L122] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L123] var_1_19 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L124] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L126] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L127] var_1_22 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L130] var_1_24 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L132] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L132] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L133] var_1_25 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L134] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L135] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L135] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L148] RET updateVariables() [L149] CALL step() [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L55] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=0, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L56] COND TRUE stepLocal_0 >= var_1_8 VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L57] COND TRUE (var_1_9 - 1.00000000000025E12) >= var_1_10 [L58] var_1_6 = 200 VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L65] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=200, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L66] COND TRUE var_1_11 > stepLocal_1 [L67] var_1_12 = 32 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L69] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_2=0, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L70] COND FALSE !(var_1_12 == stepLocal_2) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L75] EXPR var_1_11 >> var_1_8 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L75] COND TRUE (var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12) [L76] var_1_14 = var_1_15 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L80] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L81] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, stepLocal_3=200, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L82] COND FALSE !(var_1_11 == stepLocal_3) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L85] COND TRUE var_1_18 > var_1_9 [L86] var_1_23 = (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR ((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L140-L141] return (((((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))))) : (var_1_23 == ((signed short int) (var_1_7 + 1)))) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.2s, OverallIterations: 11, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2061 mSDsluCounter, 5204 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3967 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3885 IncrementalHoareTripleChecker+Invalid, 3954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 1237 mSDtfsCounter, 3885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2135 GetRequests, 1936 SyntacticMatches, 11 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=8, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1152 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 2839 NumberOfCodeBlocks, 2839 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3174 ConstructedInterpolants, 20 QuantifiedInterpolants, 23658 SizeOfPredicates, 65 NumberOfNonLiveVariables, 1563 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 24585/25272 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 03:32:20,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_steplocals_file-35.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 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:32:23,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:32:23,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:32:23,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:32:23,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:32:23,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:32:23,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:32:23,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:32:23,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:32:23,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:32:23,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:32:23,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:32:23,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:32:23,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:32:23,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:32:23,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:32:23,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:32:23,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:32:23,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:32:23,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:32:23,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:32:23,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:32:23,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:32:23,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:32:23,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:32:23,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:32:23,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:32:23,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:32:23,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:32:23,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:32:23,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:32:23,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:32:23,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:32:23,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:32:23,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:23,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:32:23,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:32:23,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:32:23,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:32:23,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:32:23,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:32:23,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:32:23,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:32:23,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:32:23,172 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 -> 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba [2024-11-10 03:32:23,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:32:23,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:32:23,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:32:23,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:32:23,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:32:23,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2024-11-10 03:32:25,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:32:25,386 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:32:25,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2024-11-10 03:32:25,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bd4b05b/ffbd906ba3bc432c8a2d1c9b30c1dbcd/FLAGc98338122 [2024-11-10 03:32:25,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5bd4b05b/ffbd906ba3bc432c8a2d1c9b30c1dbcd [2024-11-10 03:32:25,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:32:25,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:32:25,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:25,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:32:25,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:32:25,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df4ec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25, skipping insertion in model container [2024-11-10 03:32:25,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:32:25,616 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_codestructure_steplocals_file-35.i[917,930] [2024-11-10 03:32:25,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:25,713 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:32:25,727 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_codestructure_steplocals_file-35.i[917,930] [2024-11-10 03:32:25,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:25,801 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:32:25,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25 WrapperNode [2024-11-10 03:32:25,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:25,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:25,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:32:25,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:32:25,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,868 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-11-10 03:32:25,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:25,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:32:25,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:32:25,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:32:25,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,923 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 03:32:25,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:32:25,952 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:32:25,952 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:32:25,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:32:25,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (1/1) ... [2024-11-10 03:32:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:25,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:25,996 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 03:32:26,002 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 03:32:26,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:32:26,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:32:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:32:26,041 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:32:26,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:32:26,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:32:26,138 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:32:26,142 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:32:28,420 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:32:28,420 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:32:28,444 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:32:28,445 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:32:28,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:28 BoogieIcfgContainer [2024-11-10 03:32:28,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:32:28,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:32:28,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:32:28,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:32:28,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:32:25" (1/3) ... [2024-11-10 03:32:28,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8ae147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:28, skipping insertion in model container [2024-11-10 03:32:28,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:25" (2/3) ... [2024-11-10 03:32:28,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8ae147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:28, skipping insertion in model container [2024-11-10 03:32:28,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:28" (3/3) ... [2024-11-10 03:32:28,456 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-35.i [2024-11-10 03:32:28,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:32:28,473 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:32:28,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:32:28,534 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;@33a94cbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:32:28,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:32:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 03:32:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:32:28,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:28,553 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:28,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash -105431741, now seen corresponding path program 1 times [2024-11-10 03:32:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:32:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545842742] [2024-11-10 03:32:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:28,570 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 03:32:28,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:32:28,571 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 03:32:28,573 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 03:32:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:28,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:32:28,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2024-11-10 03:32:29,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:32:29,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:32:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545842742] [2024-11-10 03:32:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545842742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:32:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270313199] [2024-11-10 03:32:29,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:29,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:32:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:32:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:32:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:32:29,064 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 03:32:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:29,103 INFO L93 Difference]: Finished difference Result 150 states and 254 transitions. [2024-11-10 03:32:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:32:29,106 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2024-11-10 03:32:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:29,114 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:32:29,114 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:32:29,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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 03:32:29,124 INFO L432 NwaCegarLoop]: 109 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, 109 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 03:32:29,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:32:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:32:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:32:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 03:32:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-10 03:32:29,184 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 174 [2024-11-10 03:32:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:29,185 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-10 03:32:29,185 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, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-10 03:32:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-10 03:32:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:32:29,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:29,190 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:29,204 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 03:32:29,391 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 03:32:29,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -801426106, now seen corresponding path program 1 times [2024-11-10 03:32:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:32:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400249627] [2024-11-10 03:32:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:29,396 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 03:32:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:32:29,397 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 03:32:29,418 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 03:32:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:29,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:32:29,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-10 03:32:29,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:32:29,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:32:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400249627] [2024-11-10 03:32:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400249627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:29,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:29,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:32:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278642738] [2024-11-10 03:32:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:29,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:32:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:32:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:32:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:32:29,923 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:32,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:32:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:32,345 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2024-11-10 03:32:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:32:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-11-10 03:32:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:32,350 INFO L225 Difference]: With dead ends: 190 [2024-11-10 03:32:32,350 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 03:32:32,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 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 03:32:32,354 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 62 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:32,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 339 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 03:32:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 03:32:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2024-11-10 03:32:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-10 03:32:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2024-11-10 03:32:32,373 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 174 [2024-11-10 03:32:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:32,374 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2024-11-10 03:32:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-10 03:32:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2024-11-10 03:32:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:32:32,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:32,378 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:32:32,391 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 03:32:32,578 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 03:32:32,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:32,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash -672343387, now seen corresponding path program 1 times [2024-11-10 03:32:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:32:32,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996826186] [2024-11-10 03:32:32,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:32,581 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 03:32:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:32:32,583 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 03:32:32,583 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 03:32:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:32,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 03:32:32,971 INFO L278 TraceCheckSpWp]: Computing forward predicates...