./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:43:21,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:43:22,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:43:22,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:43:22,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:43:22,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:43:22,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:43:22,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:43:22,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:43:22,052 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:43:22,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:43:22,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:43:22,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:43:22,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:43:22,054 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:43:22,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:43:22,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:43:22,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:43:22,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:43:22,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:43:22,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:43:22,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:43:22,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:43:22,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:43:22,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:43:22,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:43:22,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:43:22,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:43:22,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:43:22,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:43:22,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:43:22,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:43:22,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:22,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:43:22,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:43:22,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:43:22,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:43:22,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:43:22,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:43:22,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:43:22,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:43:22,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:43:22,064 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-10-13 02:43:22,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:43:22,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:43:22,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:43:22,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:43:22,363 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:43:22,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:43:23,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:43:23,930 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:43:23,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:43:23,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef6dc71f/eb709ef68ef5440285168008d068b9a7/FLAG1adbc5656 [2024-10-13 02:43:24,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef6dc71f/eb709ef68ef5440285168008d068b9a7 [2024-10-13 02:43:24,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:43:24,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:43:24,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:24,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:43:24,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:43:24,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef31650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24, skipping insertion in model container [2024-10-13 02:43:24,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:43:24,541 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-13 02:43:24,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:24,650 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:43:24,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-13 02:43:24,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:24,740 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:43:24,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24 WrapperNode [2024-10-13 02:43:24,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:24,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:24,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:43:24,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:43:24,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,816 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-13 02:43:24,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:24,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:43:24,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:43:24,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:43:24,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:43:24,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:43:24,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:43:24,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:43:24,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:43:24,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (1/1) ... [2024-10-13 02:43:24,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:24,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:24,935 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-10-13 02:43:24,938 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-10-13 02:43:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:43:24,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:43:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:43:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:43:24,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:43:24,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:43:25,087 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:43:25,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:43:25,479 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:43:25,480 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:43:25,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:43:25,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:43:25,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:25 BoogieIcfgContainer [2024-10-13 02:43:25,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:43:25,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:43:25,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:43:25,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:43:25,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:43:24" (1/3) ... [2024-10-13 02:43:25,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66633bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:25, skipping insertion in model container [2024-10-13 02:43:25,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:24" (2/3) ... [2024-10-13 02:43:25,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66633bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:25, skipping insertion in model container [2024-10-13 02:43:25,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:25" (3/3) ... [2024-10-13 02:43:25,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:43:25,554 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:43:25,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:43:25,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:43:25,616 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;@7a64eec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:43:25,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:43:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:43:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 02:43:25,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:25,638 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:25,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:25,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:25,644 INFO L85 PathProgramCache]: Analyzing trace with hash -899710008, now seen corresponding path program 1 times [2024-10-13 02:43:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:25,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122591114] [2024-10-13 02:43:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:26,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122591114] [2024-10-13 02:43:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122591114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:26,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:43:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659176000] [2024-10-13 02:43:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:26,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:43:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:43:26,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:26,193 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:26,235 INFO L93 Difference]: Finished difference Result 165 states and 286 transitions. [2024-10-13 02:43:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:43:26,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-10-13 02:43:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:26,247 INFO L225 Difference]: With dead ends: 165 [2024-10-13 02:43:26,247 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 02:43:26,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:26,257 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:26,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 02:43:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 02:43:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:43:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-10-13 02:43:26,389 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 160 [2024-10-13 02:43:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-10-13 02:43:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-10-13 02:43:26,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 02:43:26,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:26,396 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:26,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:43:26,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -82626420, now seen corresponding path program 1 times [2024-10-13 02:43:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066565785] [2024-10-13 02:43:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:26,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066565785] [2024-10-13 02:43:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066565785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:26,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260184012] [2024-10-13 02:43:26,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:26,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:26,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:26,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:26,661 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:26,698 INFO L93 Difference]: Finished difference Result 164 states and 253 transitions. [2024-10-13 02:43:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:26,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-10-13 02:43:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:26,704 INFO L225 Difference]: With dead ends: 164 [2024-10-13 02:43:26,704 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 02:43:26,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:26,707 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:26,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 02:43:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 02:43:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:43:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2024-10-13 02:43:26,722 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 160 [2024-10-13 02:43:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:26,727 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2024-10-13 02:43:26,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2024-10-13 02:43:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 02:43:26,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:26,731 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:26,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:43:26,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:26,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:26,733 INFO L85 PathProgramCache]: Analyzing trace with hash -510003291, now seen corresponding path program 1 times [2024-10-13 02:43:26,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:26,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130141979] [2024-10-13 02:43:26,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:26,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130141979] [2024-10-13 02:43:27,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130141979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:27,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:27,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:43:27,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974405506] [2024-10-13 02:43:27,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:27,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:43:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:43:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:43:27,182 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:27,380 INFO L93 Difference]: Finished difference Result 165 states and 253 transitions. [2024-10-13 02:43:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:43:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-13 02:43:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:27,382 INFO L225 Difference]: With dead ends: 165 [2024-10-13 02:43:27,384 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 02:43:27,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-10-13 02:43:27,388 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 119 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:27,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 180 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 02:43:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 02:43:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:43:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2024-10-13 02:43:27,408 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 161 [2024-10-13 02:43:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:27,409 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2024-10-13 02:43:27,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2024-10-13 02:43:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 02:43:27,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:27,415 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:43:27,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:27,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash -452744989, now seen corresponding path program 1 times [2024-10-13 02:43:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876971909] [2024-10-13 02:43:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876971909] [2024-10-13 02:43:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876971909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:43:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307798732] [2024-10-13 02:43:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:43:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:43:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:43:27,936 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:28,002 INFO L93 Difference]: Finished difference Result 235 states and 361 transitions. [2024-10-13 02:43:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:43:28,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-13 02:43:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:28,007 INFO L225 Difference]: With dead ends: 235 [2024-10-13 02:43:28,007 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 02:43:28,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-10-13 02:43:28,010 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:28,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 351 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:28,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 02:43:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2024-10-13 02:43:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:43:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2024-10-13 02:43:28,045 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 161 [2024-10-13 02:43:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:28,045 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2024-10-13 02:43:28,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2024-10-13 02:43:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 02:43:28,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:28,048 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:28,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:43:28,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:28,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1718376790, now seen corresponding path program 1 times [2024-10-13 02:43:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487458160] [2024-10-13 02:43:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:28,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487458160] [2024-10-13 02:43:28,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487458160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:28,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:28,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:43:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056280389] [2024-10-13 02:43:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:28,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:43:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:43:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:43:28,303 INFO L87 Difference]: Start difference. First operand 141 states and 216 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:28,348 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2024-10-13 02:43:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:43:28,349 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-13 02:43:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:28,351 INFO L225 Difference]: With dead ends: 225 [2024-10-13 02:43:28,351 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 02:43:28,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:43:28,353 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:28,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 02:43:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-10-13 02:43:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:43:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-13 02:43:28,375 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 162 [2024-10-13 02:43:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:28,377 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-13 02:43:28,377 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-13 02:43:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 02:43:28,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:28,381 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:28,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:43:28,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:28,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:28,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2063739607, now seen corresponding path program 1 times [2024-10-13 02:43:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119774700] [2024-10-13 02:43:28,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:43:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119774700] [2024-10-13 02:43:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119774700] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:43:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762588368] [2024-10-13 02:43:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:28,831 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-10-13 02:43:28,833 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-10-13 02:43:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:28,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:43:28,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:43:29,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:43:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762588368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:29,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:43:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 02:43:29,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300380742] [2024-10-13 02:43:29,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:29,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:43:29,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:43:29,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:43:29,570 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 02:43:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:29,748 INFO L93 Difference]: Finished difference Result 250 states and 374 transitions. [2024-10-13 02:43:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:43:29,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 163 [2024-10-13 02:43:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:29,750 INFO L225 Difference]: With dead ends: 250 [2024-10-13 02:43:29,750 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 02:43:29,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:43:29,752 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 113 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 227 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:43:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 02:43:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2024-10-13 02:43:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.288659793814433) internal successors, (125), 97 states have internal predecessors, (125), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:43:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2024-10-13 02:43:29,777 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 163 [2024-10-13 02:43:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:29,777 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2024-10-13 02:43:29,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 02:43:29,778 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2024-10-13 02:43:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 02:43:29,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:29,779 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:29,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:43:29,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 02:43:29,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2125779221, now seen corresponding path program 1 times [2024-10-13 02:43:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017006601] [2024-10-13 02:43:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:43:30,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017006601] [2024-10-13 02:43:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017006601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:43:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777996215] [2024-10-13 02:43:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:30,418 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-10-13 02:43:30,420 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-10-13 02:43:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:30,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 02:43:30,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:30,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-10-13 02:43:30,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 02:43:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777996215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:31,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:43:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-13 02:43:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875709076] [2024-10-13 02:43:31,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 02:43:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 02:43:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:43:31,255 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-13 02:43:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:31,574 INFO L93 Difference]: Finished difference Result 266 states and 380 transitions. [2024-10-13 02:43:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 02:43:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 163 [2024-10-13 02:43:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:31,577 INFO L225 Difference]: With dead ends: 266 [2024-10-13 02:43:31,578 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 02:43:31,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:43:31,579 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 240 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:31,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 250 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 02:43:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-10-13 02:43:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 109 states have internal predecessors, (132), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:43:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2024-10-13 02:43:31,609 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 163 [2024-10-13 02:43:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2024-10-13 02:43:31,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-10-13 02:43:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2024-10-13 02:43:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:43:31,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:31,612 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:31,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:43:31,812 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,SelfDestructingSolverStorable6 [2024-10-13 02:43:31,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash -710781767, now seen corresponding path program 1 times [2024-10-13 02:43:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:31,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024029703] [2024-10-13 02:43:31,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:31,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024029703] [2024-10-13 02:43:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024029703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:43:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830965098] [2024-10-13 02:43:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:32,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:43:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:43:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:43:32,400 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:32,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:32,788 INFO L93 Difference]: Finished difference Result 282 states and 390 transitions. [2024-10-13 02:43:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:43:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-13 02:43:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:32,791 INFO L225 Difference]: With dead ends: 282 [2024-10-13 02:43:32,793 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 02:43:32,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:43:32,794 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 98 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:32,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:43:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 02:43:32,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2024-10-13 02:43:32,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 111 states have internal predecessors, (135), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 02:43:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2024-10-13 02:43:32,822 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 164 [2024-10-13 02:43:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:32,824 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2024-10-13 02:43:32,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2024-10-13 02:43:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:43:32,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:32,826 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:32,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 02:43:32,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:32,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:32,827 INFO L85 PathProgramCache]: Analyzing trace with hash -491927049, now seen corresponding path program 1 times [2024-10-13 02:43:32,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:32,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537047323] [2024-10-13 02:43:32,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:33,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537047323] [2024-10-13 02:43:33,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537047323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:33,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:33,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 02:43:33,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649377179] [2024-10-13 02:43:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:33,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:43:33,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:43:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:43:33,407 INFO L87 Difference]: Start difference. First operand 168 states and 231 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:34,543 INFO L93 Difference]: Finished difference Result 720 states and 972 transitions. [2024-10-13 02:43:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 02:43:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-13 02:43:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:34,548 INFO L225 Difference]: With dead ends: 720 [2024-10-13 02:43:34,548 INFO L226 Difference]: Without dead ends: 625 [2024-10-13 02:43:34,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2024-10-13 02:43:34,549 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 846 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:34,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 884 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:43:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-10-13 02:43:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 522. [2024-10-13 02:43:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 376 states have (on average 1.2632978723404256) internal successors, (475), 380 states have internal predecessors, (475), 118 states have call successors, (118), 27 states have call predecessors, (118), 27 states have return successors, (118), 114 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-13 02:43:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 711 transitions. [2024-10-13 02:43:34,646 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 711 transitions. Word has length 164 [2024-10-13 02:43:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:34,646 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 711 transitions. [2024-10-13 02:43:34,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 711 transitions. [2024-10-13 02:43:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:43:34,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:34,649 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:34,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 02:43:34,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:34,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:34,650 INFO L85 PathProgramCache]: Analyzing trace with hash -233761611, now seen corresponding path program 1 times [2024-10-13 02:43:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219284595] [2024-10-13 02:43:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219284595] [2024-10-13 02:43:34,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219284595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:34,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831303406] [2024-10-13 02:43:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:34,795 INFO L87 Difference]: Start difference. First operand 522 states and 711 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:34,882 INFO L93 Difference]: Finished difference Result 1039 states and 1403 transitions. [2024-10-13 02:43:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-13 02:43:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:34,888 INFO L225 Difference]: With dead ends: 1039 [2024-10-13 02:43:34,888 INFO L226 Difference]: Without dead ends: 608 [2024-10-13 02:43:34,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:34,891 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:34,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 231 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-13 02:43:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2024-10-13 02:43:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 441 states have (on average 1.2585034013605443) internal successors, (555), 448 states have internal predecessors, (555), 124 states have call successors, (124), 34 states have call predecessors, (124), 34 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 02:43:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 803 transitions. [2024-10-13 02:43:34,974 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 803 transitions. Word has length 164 [2024-10-13 02:43:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 803 transitions. [2024-10-13 02:43:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 803 transitions. [2024-10-13 02:43:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:43:34,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:34,976 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:34,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 02:43:34,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:34,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash -820567625, now seen corresponding path program 1 times [2024-10-13 02:43:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:34,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695678819] [2024-10-13 02:43:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695678819] [2024-10-13 02:43:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695678819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:44,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 02:43:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35147718] [2024-10-13 02:43:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:44,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 02:43:44,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:44,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 02:43:44,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:43:44,016 INFO L87 Difference]: Start difference. First operand 600 states and 803 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:46,662 INFO L93 Difference]: Finished difference Result 1201 states and 1608 transitions. [2024-10-13 02:43:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 02:43:46,663 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-10-13 02:43:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:46,669 INFO L225 Difference]: With dead ends: 1201 [2024-10-13 02:43:46,670 INFO L226 Difference]: Without dead ends: 696 [2024-10-13 02:43:46,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-10-13 02:43:46,672 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 352 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:46,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 659 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:43:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-10-13 02:43:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 632. [2024-10-13 02:43:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 473 states have (on average 1.2536997885835095) internal successors, (593), 480 states have internal predecessors, (593), 124 states have call successors, (124), 34 states have call predecessors, (124), 34 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 02:43:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 841 transitions. [2024-10-13 02:43:46,738 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 841 transitions. Word has length 164 [2024-10-13 02:43:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:46,738 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 841 transitions. [2024-10-13 02:43:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:43:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 841 transitions. [2024-10-13 02:43:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-13 02:43:46,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:46,741 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 02:43:46,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1629914251, now seen corresponding path program 1 times [2024-10-13 02:43:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722465269] [2024-10-13 02:43:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722465269] [2024-10-13 02:43:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722465269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:43:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082747342] [2024-10-13 02:43:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:43:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:43:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:43:47,130 INFO L87 Difference]: Start difference. First operand 632 states and 841 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:47,269 INFO L93 Difference]: Finished difference Result 1278 states and 1693 transitions. [2024-10-13 02:43:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:43:47,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-13 02:43:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:47,275 INFO L225 Difference]: With dead ends: 1278 [2024-10-13 02:43:47,276 INFO L226 Difference]: Without dead ends: 773 [2024-10-13 02:43:47,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:43:47,278 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 135 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:47,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 470 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:43:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-13 02:43:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 685. [2024-10-13 02:43:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 516 states have (on average 1.2422480620155039) internal successors, (641), 524 states have internal predecessors, (641), 131 states have call successors, (131), 37 states have call predecessors, (131), 37 states have return successors, (131), 123 states have call predecessors, (131), 131 states have call successors, (131) [2024-10-13 02:43:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 903 transitions. [2024-10-13 02:43:47,342 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 903 transitions. Word has length 164 [2024-10-13 02:43:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:47,343 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 903 transitions. [2024-10-13 02:43:47,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 903 transitions. [2024-10-13 02:43:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:43:47,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:47,345 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 02:43:47,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:47,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1914799012, now seen corresponding path program 1 times [2024-10-13 02:43:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243182758] [2024-10-13 02:43:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:43:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:47,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243182758] [2024-10-13 02:43:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243182758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:43:47,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333891583] [2024-10-13 02:43:47,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:47,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:47,782 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-10-13 02:43:47,784 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-10-13 02:43:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:47,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 02:43:47,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 509 proven. 126 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2024-10-13 02:43:48,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:43:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 02:43:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333891583] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:43:49,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:43:49,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 23 [2024-10-13 02:43:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587775409] [2024-10-13 02:43:49,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:43:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 02:43:49,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 02:43:49,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:43:49,013 INFO L87 Difference]: Start difference. First operand 685 states and 903 transitions. Second operand has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) [2024-10-13 02:43:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:49,930 INFO L93 Difference]: Finished difference Result 880 states and 1160 transitions. [2024-10-13 02:43:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 02:43:49,931 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) Word has length 165 [2024-10-13 02:43:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:49,934 INFO L225 Difference]: With dead ends: 880 [2024-10-13 02:43:49,934 INFO L226 Difference]: Without dead ends: 274 [2024-10-13 02:43:49,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=445, Invalid=1037, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 02:43:49,937 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 400 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:49,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 521 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:43:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-13 02:43:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2024-10-13 02:43:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 191 states have (on average 1.225130890052356) internal successors, (234), 194 states have internal predecessors, (234), 59 states have call successors, (59), 16 states have call predecessors, (59), 16 states have return successors, (59), 56 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-13 02:43:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2024-10-13 02:43:49,969 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 165 [2024-10-13 02:43:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:49,969 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2024-10-13 02:43:49,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.428571428571429) internal successors, (114), 21 states have internal predecessors, (114), 9 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (72), 8 states have call predecessors, (72), 9 states have call successors, (72) [2024-10-13 02:43:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2024-10-13 02:43:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:43:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:49,971 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:49,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 02:43:50,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:50,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1349120562, now seen corresponding path program 1 times [2024-10-13 02:43:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467306738] [2024-10-13 02:43:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467306738] [2024-10-13 02:43:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467306738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:50,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:43:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399501713] [2024-10-13 02:43:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:50,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:43:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:43:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:43:50,615 INFO L87 Difference]: Start difference. First operand 267 states and 352 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:51,417 INFO L93 Difference]: Finished difference Result 953 states and 1248 transitions. [2024-10-13 02:43:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 02:43:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-13 02:43:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:51,422 INFO L225 Difference]: With dead ends: 953 [2024-10-13 02:43:51,422 INFO L226 Difference]: Without dead ends: 805 [2024-10-13 02:43:51,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:43:51,424 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 534 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:51,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 802 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 02:43:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-13 02:43:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 514. [2024-10-13 02:43:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 370 states have internal predecessors, (443), 115 states have call successors, (115), 33 states have call predecessors, (115), 33 states have return successors, (115), 110 states have call predecessors, (115), 115 states have call successors, (115) [2024-10-13 02:43:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 673 transitions. [2024-10-13 02:43:51,493 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 673 transitions. Word has length 165 [2024-10-13 02:43:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:51,494 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 673 transitions. [2024-10-13 02:43:51,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 673 transitions. [2024-10-13 02:43:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:43:51,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:51,496 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:51,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 02:43:51,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:51,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1020479986, now seen corresponding path program 1 times [2024-10-13 02:43:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880647629] [2024-10-13 02:43:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:43:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:43:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:43:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:43:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:43:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:43:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:43:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:43:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:43:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:43:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:43:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:43:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:43:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:43:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:43:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:43:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:43:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:43:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880647629] [2024-10-13 02:43:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880647629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 02:43:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98671716] [2024-10-13 02:43:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:55,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 02:43:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 02:43:55,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-13 02:43:55,913 INFO L87 Difference]: Start difference. First operand 514 states and 673 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:58,176 INFO L93 Difference]: Finished difference Result 1144 states and 1502 transitions. [2024-10-13 02:43:58,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 02:43:58,177 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-13 02:43:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:58,182 INFO L225 Difference]: With dead ends: 1144 [2024-10-13 02:43:58,182 INFO L226 Difference]: Without dead ends: 723 [2024-10-13 02:43:58,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-10-13 02:43:58,184 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:58,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 699 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:43:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-13 02:43:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 701. [2024-10-13 02:43:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 502 states have (on average 1.2131474103585658) internal successors, (609), 508 states have internal predecessors, (609), 155 states have call successors, (155), 43 states have call predecessors, (155), 43 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-13 02:43:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 919 transitions. [2024-10-13 02:43:58,278 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 919 transitions. Word has length 165 [2024-10-13 02:43:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 919 transitions. [2024-10-13 02:43:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:43:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 919 transitions. [2024-10-13 02:43:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:43:58,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:58,282 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:58,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 02:43:58,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 211133360, now seen corresponding path program 1 times [2024-10-13 02:43:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828849157] [2024-10-13 02:43:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:44:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:44:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:44:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:44:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:44:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:44:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:44:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:44:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:44:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:44:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:44:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:44:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:44:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:44:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:44:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:44:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:44:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:44:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:44:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:44:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:44:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:44:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:44:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:44:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:44:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:44:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828849157] [2024-10-13 02:44:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828849157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 02:44:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458021736] [2024-10-13 02:44:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 02:44:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:44:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 02:44:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:44:02,424 INFO L87 Difference]: Start difference. First operand 701 states and 919 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:44:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:06,182 INFO L93 Difference]: Finished difference Result 1398 states and 1832 transitions. [2024-10-13 02:44:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 02:44:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-10-13 02:44:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:06,189 INFO L225 Difference]: With dead ends: 1398 [2024-10-13 02:44:06,189 INFO L226 Difference]: Without dead ends: 825 [2024-10-13 02:44:06,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-13 02:44:06,192 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 232 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:06,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 716 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 02:44:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-13 02:44:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 737. [2024-10-13 02:44:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 538 states have (on average 1.2063197026022305) internal successors, (649), 544 states have internal predecessors, (649), 155 states have call successors, (155), 43 states have call predecessors, (155), 43 states have return successors, (155), 149 states have call predecessors, (155), 155 states have call successors, (155) [2024-10-13 02:44:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 959 transitions. [2024-10-13 02:44:06,291 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 959 transitions. Word has length 165 [2024-10-13 02:44:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:06,292 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 959 transitions. [2024-10-13 02:44:06,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:44:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 959 transitions. [2024-10-13 02:44:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 02:44:06,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:06,294 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 02:44:06,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1142267191, now seen corresponding path program 1 times [2024-10-13 02:44:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:44:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728497891] [2024-10-13 02:44:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:44:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:44:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [782979004] [2024-10-13 02:44:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:44:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:44:06,392 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-10-13 02:44:06,393 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-10-13 02:44:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:44:06,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:44:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:44:06,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:44:06,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:44:06,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:44:06,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 02:44:07,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 02:44:07,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:07,134 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:44:07,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:44:07 BoogieIcfgContainer [2024-10-13 02:44:07,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:44:07,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:44:07,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:44:07,140 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:44:07,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:25" (3/4) ... [2024-10-13 02:44:07,142 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:44:07,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:44:07,144 INFO L158 Benchmark]: Toolchain (without parser) took 42843.68ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 71.4MB in the beginning and 417.3MB in the end (delta: -345.8MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,144 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:44:07,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.48ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 71.3MB in the beginning and 157.6MB in the end (delta: -86.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.04ms. Allocated memory is still 195.0MB. Free memory was 157.6MB in the beginning and 153.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,145 INFO L158 Benchmark]: Boogie Preprocessor took 67.97ms. Allocated memory is still 195.0MB. Free memory was 152.3MB in the beginning and 145.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,146 INFO L158 Benchmark]: RCFGBuilder took 638.72ms. Allocated memory is still 195.0MB. Free memory was 145.0MB in the beginning and 112.5MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,146 INFO L158 Benchmark]: TraceAbstraction took 41608.50ms. Allocated memory was 195.0MB in the beginning and 629.1MB in the end (delta: 434.1MB). Free memory was 111.4MB in the beginning and 417.3MB in the end (delta: -305.8MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2024-10-13 02:44:07,146 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 629.1MB. Free memory is still 417.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:44:07,147 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.20ms. Allocated memory is still 142.6MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.48ms. Allocated memory was 142.6MB in the beginning and 195.0MB in the end (delta: 52.4MB). Free memory was 71.3MB in the beginning and 157.6MB in the end (delta: -86.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.04ms. Allocated memory is still 195.0MB. Free memory was 157.6MB in the beginning and 153.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.97ms. Allocated memory is still 195.0MB. Free memory was 152.3MB in the beginning and 145.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 638.72ms. Allocated memory is still 195.0MB. Free memory was 145.0MB in the beginning and 112.5MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41608.50ms. Allocated memory was 195.0MB in the beginning and 629.1MB in the end (delta: 434.1MB). Free memory was 111.4MB in the beginning and 417.3MB in the end (delta: -305.8MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 629.1MB. Free memory is still 417.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of bitwiseAnd at line 61, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryArithmeticFLOAToperation at line 86, overapproximation of someUnaryFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] var_1_31 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L57] COND FALSE !(! var_1_7) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L60] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L62] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_38=0, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !(var_1_36 <= var_1_16) [L69] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L71] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L76] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] EXPR var_1_18 & var_1_27 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] COND TRUE var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) [L79] COND FALSE !(-2 > var_1_27) [L82] var_1_49 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L85] COND TRUE \read(var_1_8) [L86] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] COND TRUE \read(var_1_8) [L89] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] var_1_29 = var_1_27 [L92] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L96] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L98] var_1_17 = ((var_1_18 - 25) - var_1_25) [L99] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16396, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L100] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L101] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L105] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L106] COND FALSE !((~ var_1_29) > stepLocal_3) [L109] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=16396, var_1_18=16421, var_1_1=1, var_1_20=0, var_1_21=119, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-512, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=-512, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=-512, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3342 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3327 mSDsluCounter, 7122 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5169 mSDsCounter, 903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4374 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 903 mSolverCounterUnsat, 1953 mSDtfsCounter, 4374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1991 GetRequests, 1797 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=16, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 705 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 3433 NumberOfCodeBlocks, 3433 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3570 ConstructedInterpolants, 0 QuantifiedInterpolants, 15536 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 23583/24288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:44:07,321 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:44:09,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:44:09,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:44:09,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:44:09,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:44:09,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:44:09,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:44:09,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:44:09,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:44:09,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:44:09,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:44:09,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:44:09,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:44:09,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:44:09,511 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:44:09,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:44:09,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:44:09,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:44:09,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:44:09,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:44:09,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:44:09,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:44:09,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:44:09,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:44:09,518 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:44:09,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:44:09,518 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:44:09,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:44:09,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:44:09,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:44:09,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:44:09,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:44:09,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:44:09,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:44:09,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:44:09,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:44:09,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:44:09,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:44:09,523 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:44:09,523 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:44:09,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:44:09,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:44:09,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:44:09,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:44:09,524 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:44:09,525 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-10-13 02:44:09,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:44:09,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:44:09,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:44:09,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:44:09,883 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:44:09,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:44:11,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:44:11,681 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:44:11,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:44:11,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf80b51f/98a9fbd40b484ca1ad3debc24906c0e6/FLAGb0319b4f9 [2024-10-13 02:44:11,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdf80b51f/98a9fbd40b484ca1ad3debc24906c0e6 [2024-10-13 02:44:11,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:44:11,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:44:11,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:44:11,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:44:11,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:44:11,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:44:11" (1/1) ... [2024-10-13 02:44:11,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3cccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:11, skipping insertion in model container [2024-10-13 02:44:11,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:44:11" (1/1) ... [2024-10-13 02:44:11,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:44:11,973 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-13 02:44:12,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:44:12,087 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:44:12,101 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-10-13 02:44:12,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:44:12,166 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:44:12,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12 WrapperNode [2024-10-13 02:44:12,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:44:12,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:44:12,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:44:12,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:44:12,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,219 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-13 02:44:12,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:44:12,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:44:12,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:44:12,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:44:12,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:44:12,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:44:12,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:44:12,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:44:12,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:44:12,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (1/1) ... [2024-10-13 02:44:12,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:44:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:44:12,334 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-10-13 02:44:12,340 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-10-13 02:44:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:44:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:44:12,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:44:12,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:44:12,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:44:12,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:44:12,495 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:44:12,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:44:21,852 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:44:21,852 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:44:21,909 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:44:21,910 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:44:21,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:44:21 BoogieIcfgContainer [2024-10-13 02:44:21,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:44:21,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:44:21,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:44:21,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:44:21,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:44:11" (1/3) ... [2024-10-13 02:44:21,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b75066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:44:21, skipping insertion in model container [2024-10-13 02:44:21,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:44:12" (2/3) ... [2024-10-13 02:44:21,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b75066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:44:21, skipping insertion in model container [2024-10-13 02:44:21,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:44:21" (3/3) ... [2024-10-13 02:44:21,918 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-10-13 02:44:21,935 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:44:21,935 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:44:22,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:44:22,008 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;@21c413b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:44:22,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:44:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:44:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:44:22,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:22,028 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:22,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1633757492, now seen corresponding path program 1 times [2024-10-13 02:44:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:22,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002317553] [2024-10-13 02:44:22,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:22,052 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-10-13 02:44:22,053 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-10-13 02:44:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:22,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:44:22,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-13 02:44:22,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:22,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002317553] [2024-10-13 02:44:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002317553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:22,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:44:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568536580] [2024-10-13 02:44:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:44:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:22,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:44:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:44:22,744 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:44:22,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:22,948 INFO L93 Difference]: Finished difference Result 143 states and 252 transitions. [2024-10-13 02:44:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:44:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-10-13 02:44:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:22,966 INFO L225 Difference]: With dead ends: 143 [2024-10-13 02:44:22,967 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 02:44:22,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:44:22,974 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:22,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:44:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 02:44:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 02:44:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:44:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-13 02:44:23,012 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 156 [2024-10-13 02:44:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:23,013 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-13 02:44:23,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 02:44:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-13 02:44:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:44:23,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:23,016 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:23,035 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-10-13 02:44:23,216 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-10-13 02:44:23,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1016455160, now seen corresponding path program 1 times [2024-10-13 02:44:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824331841] [2024-10-13 02:44:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:23,222 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-10-13 02:44:23,223 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-10-13 02:44:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:23,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:44:23,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 02:44:25,595 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:44:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-13 02:44:26,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824331841] [2024-10-13 02:44:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824331841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:44:26,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:44:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 02:44:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392971860] [2024-10-13 02:44:26,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:44:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:44:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:44:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:44:26,967 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 02:44:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:28,207 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2024-10-13 02:44:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:44:28,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 156 [2024-10-13 02:44:28,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:28,210 INFO L225 Difference]: With dead ends: 148 [2024-10-13 02:44:28,210 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 02:44:28,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:44:28,213 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 81 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:28,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 175 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:44:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 02:44:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-13 02:44:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:44:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-10-13 02:44:28,227 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 156 [2024-10-13 02:44:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:28,228 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-10-13 02:44:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-13 02:44:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-10-13 02:44:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:44:28,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:28,231 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:28,257 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-10-13 02:44:28,432 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-10-13 02:44:28,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:28,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:28,433 INFO L85 PathProgramCache]: Analyzing trace with hash -672488582, now seen corresponding path program 1 times [2024-10-13 02:44:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246656407] [2024-10-13 02:44:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:28,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:28,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:28,436 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-10-13 02:44:28,437 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-10-13 02:44:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:28,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:44:28,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 02:44:29,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:29,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246656407] [2024-10-13 02:44:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246656407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:29,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:29,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:44:29,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609246694] [2024-10-13 02:44:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:29,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:44:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:29,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:44:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:44:29,112 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:44:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:29,522 INFO L93 Difference]: Finished difference Result 210 states and 313 transitions. [2024-10-13 02:44:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:44:29,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-10-13 02:44:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:29,525 INFO L225 Difference]: With dead ends: 210 [2024-10-13 02:44:29,525 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 02:44:29,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:44:29,527 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 102 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:29,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 462 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:44:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 02:44:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2024-10-13 02:44:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 02:44:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2024-10-13 02:44:29,568 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 156 [2024-10-13 02:44:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:29,569 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2024-10-13 02:44:29,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 02:44:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2024-10-13 02:44:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 02:44:29,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:29,576 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:29,644 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-13 02:44:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-13 02:44:29,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -615230280, now seen corresponding path program 1 times [2024-10-13 02:44:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141777848] [2024-10-13 02:44:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:29,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:29,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:29,780 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-13 02:44:29,781 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 (5)] Waiting until timeout for monitored process [2024-10-13 02:44:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:30,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 02:44:30,247 INFO L278 TraceCheckSpWp]: Computing forward predicates...