./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:18:07,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:18:07,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:18:07,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:18:07,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:18:07,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:18:07,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:18:07,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:18:07,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:18:07,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:18:07,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:18:07,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:18:07,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:18:07,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:18:07,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:18:07,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:18:07,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:18:07,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:18:07,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:18:07,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:18:07,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:18:07,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:18:07,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:18:07,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:18:07,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:18:07,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:18:07,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:18:07,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:18:07,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:18:07,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:18:07,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:18:07,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:18:07,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:07,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:18:07,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:18:07,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:18:07,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:18:07,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:18:07,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:18:07,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:18:07,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:18:07,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:18:07,306 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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 [2024-11-16 12:18:07,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:18:07,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:18:07,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:18:07,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:18:07,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:18:07,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-11-16 12:18:09,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:18:09,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:18:09,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-11-16 12:18:09,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc6d23ed/261a98908ce44efaa336b12956948aba/FLAGb97ff9028 [2024-11-16 12:18:09,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bc6d23ed/261a98908ce44efaa336b12956948aba [2024-11-16 12:18:09,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:18:09,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:18:09,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:09,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:18:09,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:18:09,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1c6b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09, skipping insertion in model container [2024-11-16 12:18:09,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:18:09,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i[913,926] [2024-11-16 12:18:09,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:09,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:18:09,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i[913,926] [2024-11-16 12:18:09,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:09,750 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:18:09,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09 WrapperNode [2024-11-16 12:18:09,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:09,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:09,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:18:09,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:18:09,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,819 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-16 12:18:09,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:09,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:18:09,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:18:09,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:18:09,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,856 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:18:09,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:18:09,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:18:09,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:18:09,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:18:09,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (1/1) ... [2024-11-16 12:18:09,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:18:09,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:18:09,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:18:09,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:18:09,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:18:09,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:18:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:18:09,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:18:09,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:18:10,053 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:18:10,056 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:18:10,478 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:18:10,478 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:18:10,499 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:18:10,499 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:18:10,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:10 BoogieIcfgContainer [2024-11-16 12:18:10,500 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:18:10,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:18:10,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:18:10,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:18:10,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:09" (1/3) ... [2024-11-16 12:18:10,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a92c6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:10, skipping insertion in model container [2024-11-16 12:18:10,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:09" (2/3) ... [2024-11-16 12:18:10,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a92c6a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:10, skipping insertion in model container [2024-11-16 12:18:10,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:10" (3/3) ... [2024-11-16 12:18:10,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i [2024-11-16 12:18:10,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:18:10,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:18:10,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:18:10,612 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;@6b75dbab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:18:10,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:18:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:10,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:10,652 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:10,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1077986449, now seen corresponding path program 1 times [2024-11-16 12:18:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:10,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470436206] [2024-11-16 12:18:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470436206] [2024-11-16 12:18:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470436206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:18:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361408096] [2024-11-16 12:18:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:11,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:18:11,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:18:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:11,130 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:18:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:11,173 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2024-11-16 12:18:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:18:11,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-11-16 12:18:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:11,184 INFO L225 Difference]: With dead ends: 144 [2024-11-16 12:18:11,184 INFO L226 Difference]: Without dead ends: 71 [2024-11-16 12:18:11,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:11,194 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:11,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:18:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-16 12:18:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-16 12:18:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-11-16 12:18:11,255 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 172 [2024-11-16 12:18:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:11,258 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-11-16 12:18:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:18:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-11-16 12:18:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:11,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:11,265 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:18:11,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2131218705, now seen corresponding path program 1 times [2024-11-16 12:18:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117417656] [2024-11-16 12:18:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117417656] [2024-11-16 12:18:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117417656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:18:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976434126] [2024-11-16 12:18:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:18:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:18:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:24,996 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:26,403 INFO L93 Difference]: Finished difference Result 146 states and 201 transitions. [2024-11-16 12:18:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:18:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:26,407 INFO L225 Difference]: With dead ends: 146 [2024-11-16 12:18:26,407 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 12:18:26,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:18:26,409 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 192 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:26,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 685 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:18:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 12:18:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 83. [2024-11-16 12:18:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-11-16 12:18:26,434 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 172 [2024-11-16 12:18:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:26,435 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-11-16 12:18:26,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-11-16 12:18:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:26,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:26,438 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:18:26,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1243715024, now seen corresponding path program 1 times [2024-11-16 12:18:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127830340] [2024-11-16 12:18:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:26,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127830340] [2024-11-16 12:18:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127830340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:18:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810066335] [2024-11-16 12:18:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:29,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:18:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:18:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:29,207 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:29,955 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2024-11-16 12:18:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:18:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:29,961 INFO L225 Difference]: With dead ends: 170 [2024-11-16 12:18:29,961 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 12:18:29,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:18:29,962 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 146 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:29,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 671 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:18:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 12:18:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2024-11-16 12:18:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 12:18:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-16 12:18:29,994 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 172 [2024-11-16 12:18:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:29,995 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-16 12:18:29,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-16 12:18:29,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:30,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:30,001 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:18:30,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -388408370, now seen corresponding path program 1 times [2024-11-16 12:18:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449880940] [2024-11-16 12:18:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449880940] [2024-11-16 12:18:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449880940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:18:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407489569] [2024-11-16 12:18:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:32,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:18:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:18:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:32,301 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:32,926 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2024-11-16 12:18:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:18:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:32,929 INFO L225 Difference]: With dead ends: 170 [2024-11-16 12:18:32,929 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 12:18:32,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:18:32,934 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 165 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:32,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 593 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:18:32,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 12:18:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 104. [2024-11-16 12:18:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.25) internal successors, (80), 65 states have internal predecessors, (80), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 12:18:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-16 12:18:32,955 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 172 [2024-11-16 12:18:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:32,955 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-16 12:18:32,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-16 12:18:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:32,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:32,958 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:18:32,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 499095311, now seen corresponding path program 1 times [2024-11-16 12:18:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506837244] [2024-11-16 12:18:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:34,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:34,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506837244] [2024-11-16 12:18:34,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506837244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:34,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:34,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:18:34,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354275398] [2024-11-16 12:18:34,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:18:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:18:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:34,850 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:35,548 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2024-11-16 12:18:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:18:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:35,553 INFO L225 Difference]: With dead ends: 173 [2024-11-16 12:18:35,553 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 12:18:35,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:18:35,556 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 141 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:35,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 704 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:18:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 12:18:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 103. [2024-11-16 12:18:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 12:18:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-11-16 12:18:35,586 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 172 [2024-11-16 12:18:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-11-16 12:18:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-11-16 12:18:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:35,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:35,592 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:35,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:18:35,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash 366797232, now seen corresponding path program 1 times [2024-11-16 12:18:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:35,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023032648] [2024-11-16 12:18:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:35,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:37,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:37,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023032648] [2024-11-16 12:18:37,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023032648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:37,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:37,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:18:37,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928287331] [2024-11-16 12:18:37,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:37,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:18:37,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:37,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:18:37,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:18:37,509 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:39,058 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2024-11-16 12:18:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:18:39,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:39,062 INFO L225 Difference]: With dead ends: 236 [2024-11-16 12:18:39,062 INFO L226 Difference]: Without dead ends: 233 [2024-11-16 12:18:39,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-16 12:18:39,063 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 305 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:39,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 703 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:18:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-16 12:18:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 167. [2024-11-16 12:18:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 12:18:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-11-16 12:18:39,090 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 172 [2024-11-16 12:18:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:39,091 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-11-16 12:18:39,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-11-16 12:18:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:39,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:39,095 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:39,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:18:39,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:39,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1254300913, now seen corresponding path program 1 times [2024-11-16 12:18:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:39,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261620572] [2024-11-16 12:18:39,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261620572] [2024-11-16 12:18:41,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261620572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:41,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:41,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:18:41,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296956726] [2024-11-16 12:18:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:41,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:18:41,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:41,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:18:41,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:18:41,267 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:42,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:42,922 INFO L93 Difference]: Finished difference Result 304 states and 414 transitions. [2024-11-16 12:18:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 12:18:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:42,925 INFO L225 Difference]: With dead ends: 304 [2024-11-16 12:18:42,925 INFO L226 Difference]: Without dead ends: 301 [2024-11-16 12:18:42,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2024-11-16 12:18:42,927 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 310 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:42,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 734 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:18:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-16 12:18:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 170. [2024-11-16 12:18:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 12:18:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2024-11-16 12:18:42,954 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 172 [2024-11-16 12:18:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:42,955 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2024-11-16 12:18:42,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2024-11-16 12:18:42,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:42,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:42,957 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:42,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:18:42,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:42,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2109607567, now seen corresponding path program 1 times [2024-11-16 12:18:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401930567] [2024-11-16 12:18:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 12:18:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401930567] [2024-11-16 12:18:48,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401930567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:48,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:48,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:18:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152870236] [2024-11-16 12:18:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:48,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:18:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:18:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:48,556 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:49,175 INFO L93 Difference]: Finished difference Result 233 states and 328 transitions. [2024-11-16 12:18:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:18:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-16 12:18:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:49,177 INFO L225 Difference]: With dead ends: 233 [2024-11-16 12:18:49,177 INFO L226 Difference]: Without dead ends: 230 [2024-11-16 12:18:49,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:18:49,178 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 132 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:49,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 553 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:18:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-16 12:18:49,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 86. [2024-11-16 12:18:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-11-16 12:18:49,193 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 172 [2024-11-16 12:18:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:49,193 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-11-16 12:18:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 12:18:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-11-16 12:18:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:18:49,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:49,195 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:49,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:18:49,196 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:49,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1851988276, now seen corresponding path program 1 times [2024-11-16 12:18:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:49,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543079308] [2024-11-16 12:18:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:18:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:18:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:18:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:18:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:18:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 12:18:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 12:18:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 12:18:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 12:18:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 12:18:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-16 12:18:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-16 12:18:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-16 12:18:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 12:18:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543079308] [2024-11-16 12:18:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543079308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:18:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000463632] [2024-11-16 12:18:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:49,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:18:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:18:49,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:18:49,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:18:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:49,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:18:49,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:18:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-16 12:18:49,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:18:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 12:18:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000463632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:18:49,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:18:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 12:18:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249760132] [2024-11-16 12:18:49,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:18:49,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:18:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:18:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:18:49,788 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-16 12:18:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:49,986 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2024-11-16 12:18:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:18:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 173 [2024-11-16 12:18:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:49,988 INFO L225 Difference]: With dead ends: 174 [2024-11-16 12:18:49,988 INFO L226 Difference]: Without dead ends: 91 [2024-11-16 12:18:49,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:18:49,990 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:49,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 164 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:18:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-16 12:18:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2024-11-16 12:18:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-16 12:18:50,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 173 [2024-11-16 12:18:50,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:50,008 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-16 12:18:50,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-16 12:18:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-16 12:18:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-16 12:18:50,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:50,012 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:50,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:18:50,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:18:50,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:50,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1799865133, now seen corresponding path program 1 times [2024-11-16 12:18:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732306498] [2024-11-16 12:18:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:18:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645744863] [2024-11-16 12:18:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:18:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:18:50,264 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:18:50,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:18:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:18:50,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:18:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:18:50,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:18:50,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:18:50,732 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:18:50,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 12:18:50,935 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,SelfDestructingSolverStorable9 [2024-11-16 12:18:50,938 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:51,049 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:18:51,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:18:51 BoogieIcfgContainer [2024-11-16 12:18:51,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:18:51,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:18:51,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:18:51,053 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:18:51,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:10" (3/4) ... [2024-11-16 12:18:51,056 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:18:51,057 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:18:51,058 INFO L158 Benchmark]: Toolchain (without parser) took 41719.86ms. Allocated memory was 159.4MB in the beginning and 645.9MB in the end (delta: 486.5MB). Free memory was 129.7MB in the beginning and 538.3MB in the end (delta: -408.6MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,058 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:18:51,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.03ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 113.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.35ms. Allocated memory is still 159.4MB. Free memory was 113.4MB in the beginning and 109.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,059 INFO L158 Benchmark]: Boogie Preprocessor took 62.31ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 103.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,059 INFO L158 Benchmark]: IcfgBuilder took 616.37ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 79.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,059 INFO L158 Benchmark]: TraceAbstraction took 40548.69ms. Allocated memory was 159.4MB in the beginning and 645.9MB in the end (delta: 486.5MB). Free memory was 79.0MB in the beginning and 539.3MB in the end (delta: -460.3MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-16 12:18:51,060 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 645.9MB. Free memory is still 538.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:18:51,061 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.19ms. Allocated memory is still 159.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.03ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 113.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.35ms. Allocated memory is still 159.4MB. Free memory was 113.4MB in the beginning and 109.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.31ms. Allocated memory is still 159.4MB. Free memory was 109.2MB in the beginning and 103.8MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 616.37ms. Allocated memory is still 159.4MB. Free memory was 103.4MB in the beginning and 79.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 40548.69ms. Allocated memory was 159.4MB in the beginning and 645.9MB in the end (delta: 486.5MB). Free memory was 79.0MB in the beginning and 539.3MB in the end (delta: -460.3MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 645.9MB. Free memory is still 538.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 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 16; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 200; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = 128; [L32] signed short int var_1_11 = 5; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -32; [L35] signed char var_1_14 = 2; [L36] signed char var_1_15 = 25; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 0; [L39] signed long int var_1_18 = -16; [L40] float var_1_19 = 2.775; [L41] unsigned long int var_1_20 = 2381110720; [L42] float var_1_21 = 10000000000000.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_2=25, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L107] var_1_7 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] var_1_8 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L115] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L116] var_1_13 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L117] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L118] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L119] var_1_14 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L120] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L122] var_1_16 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L123] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L125] var_1_17 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L127] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L127] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L128] var_1_20 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L131] var_1_21 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L145] RET updateVariables() [L146] CALL step() [L46] COND FALSE !((var_1_2 / var_1_3) <= 2) [L57] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L59] COND TRUE var_1_3 <= var_1_2 [L60] var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))) VAL [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L62] COND TRUE var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5) [L63] var_1_11 = ((var_1_5 + var_1_2) + var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L69] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L70] COND TRUE \read(var_1_7) [L71] var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L73] COND TRUE var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3))) [L74] var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L78] COND TRUE 100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L79] COND TRUE var_1_20 > 1u VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L80] COND TRUE \read(var_1_9) [L81] var_1_19 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.4s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1478 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1453 mSDsluCounter, 4915 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3837 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1987 IncrementalHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1078 mSDtfsCounter, 1987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1013 GetRequests, 903 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=7, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 603 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 2070 NumberOfCodeBlocks, 2070 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1884 ConstructedInterpolants, 0 QuantifiedInterpolants, 9400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 376 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 16614/16632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:18:51,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:18:53,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:18:53,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:18:53,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:18:53,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:18:53,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:18:53,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:18:53,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:18:53,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:18:53,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:18:53,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:18:53,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:18:53,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:18:53,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:18:53,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:18:53,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:18:53,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:18:53,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:18:53,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:18:53,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:18:53,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:18:53,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:18:53,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:18:53,445 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:18:53,445 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:18:53,445 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:18:53,445 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:18:53,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:18:53,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:18:53,446 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:18:53,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:18:53,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:18:53,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:18:53,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:18:53,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:53,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:18:53,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:18:53,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:18:53,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:18:53,450 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:18:53,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:18:53,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:18:53,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:18:53,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:18:53,451 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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497 [2024-11-16 12:18:53,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:18:53,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:18:53,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:18:53,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:18:53,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:18:53,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-11-16 12:18:55,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:18:55,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:18:55,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i [2024-11-16 12:18:55,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217f93b50/32bbca71071d4ba1b20a0b6dbe104121/FLAG3c88eb1c1 [2024-11-16 12:18:56,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217f93b50/32bbca71071d4ba1b20a0b6dbe104121 [2024-11-16 12:18:56,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:18:56,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:18:56,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:56,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:18:56,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:18:56,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b4c3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56, skipping insertion in model container [2024-11-16 12:18:56,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:18:56,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i[913,926] [2024-11-16 12:18:56,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:56,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:18:56,357 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i[913,926] [2024-11-16 12:18:56,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:56,426 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:18:56,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56 WrapperNode [2024-11-16 12:18:56,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:56,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:56,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:18:56,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:18:56,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,486 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-16 12:18:56,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:56,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:18:56,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:18:56,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:18:56,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,528 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:18:56,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:18:56,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:18:56,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:18:56,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:18:56,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (1/1) ... [2024-11-16 12:18:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:18:56,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:18:56,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:18:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:18:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:18:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:18:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:18:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:18:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:18:56,715 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:18:56,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:18:57,095 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:18:57,096 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:18:57,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:18:57,116 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:18:57,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:57 BoogieIcfgContainer [2024-11-16 12:18:57,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:18:57,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:18:57,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:18:57,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:18:57,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:56" (1/3) ... [2024-11-16 12:18:57,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a6e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:57, skipping insertion in model container [2024-11-16 12:18:57,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:56" (2/3) ... [2024-11-16 12:18:57,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a6e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:57, skipping insertion in model container [2024-11-16 12:18:57,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:57" (3/3) ... [2024-11-16 12:18:57,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i [2024-11-16 12:18:57,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:18:57,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:18:57,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:18:57,220 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;@4547f360, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:18:57,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:18:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:57,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:57,244 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:57,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1077986449, now seen corresponding path program 1 times [2024-11-16 12:18:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:18:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024231913] [2024-11-16 12:18:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:57,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:18:57,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:18:57,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:18:57,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:18:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:18:57,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:18:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-16 12:18:57,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:18:57,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:18:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024231913] [2024-11-16 12:18:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024231913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:18:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308158419] [2024-11-16 12:18:57,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:57,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:18:57,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:18:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:18:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:57,626 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:18:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:57,651 INFO L93 Difference]: Finished difference Result 144 states and 255 transitions. [2024-11-16 12:18:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:18:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-11-16 12:18:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:57,659 INFO L225 Difference]: With dead ends: 144 [2024-11-16 12:18:57,659 INFO L226 Difference]: Without dead ends: 71 [2024-11-16 12:18:57,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:57,665 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:57,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:18:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-16 12:18:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-16 12:18:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 12:18:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-11-16 12:18:57,715 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 172 [2024-11-16 12:18:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:57,715 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-11-16 12:18:57,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 12:18:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-11-16 12:18:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 12:18:57,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:57,728 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:57,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:18:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:18:57,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2131218705, now seen corresponding path program 1 times [2024-11-16 12:18:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:18:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121321389] [2024-11-16 12:18:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:57,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:18:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:18:57,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:18:57,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:18:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:58,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 12:18:58,136 INFO L278 TraceCheckSpWp]: Computing forward predicates...