./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_fillercode_fillercodestructure_filler-pr-ci_file-3.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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:41:15,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:41:15,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:41:15,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:41:15,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:41:15,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:41:15,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:41:15,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:41:15,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:41:15,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:41:15,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:41:15,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:41:15,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:41:15,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:41:15,615 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:41:15,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:41:15,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:41:15,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:41:15,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:41:15,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:41:15,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:41:15,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:41:15,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:41:15,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:41:15,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:41:15,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:41:15,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:41:15,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:41:15,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:41:15,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:41:15,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:41:15,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:41:15,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:15,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:41:15,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:41:15,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:41:15,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:41:15,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:41:15,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:41:15,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:41:15,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:41:15,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:41:15,625 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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 [2024-11-08 21:41:15,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:41:15,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:41:15,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:41:15,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:41:15,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:41:15,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:41:17,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:41:17,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:41:17,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:41:17,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b4c4ac5/71a3f8e40ece40feaf3aca5a2e831974/FLAG0183cdd6f [2024-11-08 21:41:17,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9b4c4ac5/71a3f8e40ece40feaf3aca5a2e831974 [2024-11-08 21:41:17,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:41:17,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:41:17,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:17,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:41:17,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:41:17,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:17" (1/1) ... [2024-11-08 21:41:17,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@835feee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:17, skipping insertion in model container [2024-11-08 21:41:17,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:17" (1/1) ... [2024-11-08 21:41:17,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:41:17,896 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2024-11-08 21:41:17,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:17,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:41:17,997 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2024-11-08 21:41:18,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:18,043 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:41:18,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18 WrapperNode [2024-11-08 21:41:18,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:18,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:18,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:41:18,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:41:18,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,120 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-08 21:41:18,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:18,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:41:18,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:41:18,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:41:18,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,220 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-08 21:41:18,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:41:18,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:41:18,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:41:18,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:41:18,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (1/1) ... [2024-11-08 21:41:18,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:18,327 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-08 21:41:18,334 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-08 21:41:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:41:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:41:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:41:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:41:18,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:41:18,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:41:18,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:41:18,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:41:19,007 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 21:41:19,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:41:19,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:41:19,025 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:41:19,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:19 BoogieIcfgContainer [2024-11-08 21:41:19,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:41:19,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:41:19,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:41:19,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:41:19,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:41:17" (1/3) ... [2024-11-08 21:41:19,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1cfc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:19, skipping insertion in model container [2024-11-08 21:41:19,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:18" (2/3) ... [2024-11-08 21:41:19,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1cfc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:19, skipping insertion in model container [2024-11-08 21:41:19,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:19" (3/3) ... [2024-11-08 21:41:19,033 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:41:19,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:41:19,052 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:41:19,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:41:19,122 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;@47a2edbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:41:19,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:41:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 80 states have (on average 1.55) internal successors, (124), 81 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:41:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 21:41:19,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:19,139 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:19,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:19,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1581001772, now seen corresponding path program 1 times [2024-11-08 21:41:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013662027] [2024-11-08 21:41:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013662027] [2024-11-08 21:41:19,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013662027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:19,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:19,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:41:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765405112] [2024-11-08 21:41:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:41:19,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:19,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:41:19,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:19,632 INFO L87 Difference]: Start difference. First operand has 106 states, 80 states have (on average 1.55) internal successors, (124), 81 states have internal predecessors, (124), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:19,698 INFO L93 Difference]: Finished difference Result 205 states and 357 transitions. [2024-11-08 21:41:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:41:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 160 [2024-11-08 21:41:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:19,714 INFO L225 Difference]: With dead ends: 205 [2024-11-08 21:41:19,714 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 21:41:19,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-08 21:41:19,722 INFO L432 NwaCegarLoop]: 162 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, 162 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-08 21:41:19,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 21:41:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-08 21:41:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 77 states have internal predecessors, (116), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:41:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2024-11-08 21:41:19,822 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 160 [2024-11-08 21:41:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:19,822 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2024-11-08 21:41:19,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2024-11-08 21:41:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 21:41:19,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:19,826 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:19,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:41:19,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1926525738, now seen corresponding path program 1 times [2024-11-08 21:41:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:19,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374386735] [2024-11-08 21:41:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:19,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374386735] [2024-11-08 21:41:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374386735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365023910] [2024-11-08 21:41:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:20,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:20,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:20,318 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:20,406 INFO L93 Difference]: Finished difference Result 300 states and 480 transitions. [2024-11-08 21:41:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2024-11-08 21:41:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:20,412 INFO L225 Difference]: With dead ends: 300 [2024-11-08 21:41:20,412 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 21:41:20,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:20,417 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 101 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:20,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 324 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 21:41:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-08 21:41:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 21:41:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 316 transitions. [2024-11-08 21:41:20,465 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 316 transitions. Word has length 160 [2024-11-08 21:41:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:20,465 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 316 transitions. [2024-11-08 21:41:20,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2024-11-08 21:41:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:41:20,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:20,470 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:20,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:41:20,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash 5358027, now seen corresponding path program 1 times [2024-11-08 21:41:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:20,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11920171] [2024-11-08 21:41:20,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:20,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11920171] [2024-11-08 21:41:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11920171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422981584] [2024-11-08 21:41:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:20,707 INFO L87 Difference]: Start difference. First operand 199 states and 316 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:20,763 INFO L93 Difference]: Finished difference Result 505 states and 804 transitions. [2024-11-08 21:41:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-11-08 21:41:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:20,769 INFO L225 Difference]: With dead ends: 505 [2024-11-08 21:41:20,771 INFO L226 Difference]: Without dead ends: 309 [2024-11-08 21:41:20,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:20,773 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 77 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:20,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 372 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-08 21:41:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 251. [2024-11-08 21:41:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 202 states have (on average 1.5148514851485149) internal successors, (306), 202 states have internal predecessors, (306), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 21:41:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 398 transitions. [2024-11-08 21:41:20,811 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 398 transitions. Word has length 161 [2024-11-08 21:41:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:20,812 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 398 transitions. [2024-11-08 21:41:20,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 398 transitions. [2024-11-08 21:41:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 21:41:20,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:20,814 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:41:20,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:20,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 361578453, now seen corresponding path program 1 times [2024-11-08 21:41:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:20,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93212368] [2024-11-08 21:41:20,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:20,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:20,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:20,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93212368] [2024-11-08 21:41:21,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93212368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:21,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:21,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:41:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176185516] [2024-11-08 21:41:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:41:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:41:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:21,002 INFO L87 Difference]: Start difference. First operand 251 states and 398 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:21,104 INFO L93 Difference]: Finished difference Result 719 states and 1146 transitions. [2024-11-08 21:41:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:41:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-11-08 21:41:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:21,109 INFO L225 Difference]: With dead ends: 719 [2024-11-08 21:41:21,111 INFO L226 Difference]: Without dead ends: 471 [2024-11-08 21:41:21,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:41:21,115 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 135 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:21,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 411 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-08 21:41:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-11-08 21:41:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 372 states have (on average 1.4838709677419355) internal successors, (552), 372 states have internal predecessors, (552), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 21:41:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 736 transitions. [2024-11-08 21:41:21,150 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 736 transitions. Word has length 161 [2024-11-08 21:41:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:21,151 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 736 transitions. [2024-11-08 21:41:21,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 736 transitions. [2024-11-08 21:41:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 21:41:21,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:21,157 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:21,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:41:21,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 56208470, now seen corresponding path program 1 times [2024-11-08 21:41:21,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:21,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382616479] [2024-11-08 21:41:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382616479] [2024-11-08 21:41:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382616479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412426379] [2024-11-08 21:41:21,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:21,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:21,366 INFO L87 Difference]: Start difference. First operand 469 states and 736 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:21,756 INFO L93 Difference]: Finished difference Result 1431 states and 2247 transitions. [2024-11-08 21:41:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-08 21:41:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:21,761 INFO L225 Difference]: With dead ends: 1431 [2024-11-08 21:41:21,761 INFO L226 Difference]: Without dead ends: 965 [2024-11-08 21:41:21,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:21,764 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 337 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:21,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 555 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:41:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-08 21:41:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 757. [2024-11-08 21:41:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 632 states have (on average 1.5063291139240507) internal successors, (952), 636 states have internal predecessors, (952), 116 states have call successors, (116), 8 states have call predecessors, (116), 8 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 21:41:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1184 transitions. [2024-11-08 21:41:21,801 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1184 transitions. Word has length 162 [2024-11-08 21:41:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:21,802 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1184 transitions. [2024-11-08 21:41:21,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:21,802 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1184 transitions. [2024-11-08 21:41:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 21:41:21,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:21,804 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:41:21,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 857166822, now seen corresponding path program 1 times [2024-11-08 21:41:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581830938] [2024-11-08 21:41:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:22,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581830938] [2024-11-08 21:41:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581830938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:22,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17226723] [2024-11-08 21:41:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:22,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:22,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:22,094 INFO L87 Difference]: Start difference. First operand 757 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:22,452 INFO L93 Difference]: Finished difference Result 2591 states and 4087 transitions. [2024-11-08 21:41:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-08 21:41:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:22,462 INFO L225 Difference]: With dead ends: 2591 [2024-11-08 21:41:22,462 INFO L226 Difference]: Without dead ends: 1794 [2024-11-08 21:41:22,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:22,466 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 444 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:22,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 515 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:41:22,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2024-11-08 21:41:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1547. [2024-11-08 21:41:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1329 states have (on average 1.5334838224228744) internal successors, (2038), 1336 states have internal predecessors, (2038), 203 states have call successors, (203), 14 states have call predecessors, (203), 14 states have return successors, (203), 196 states have call predecessors, (203), 203 states have call successors, (203) [2024-11-08 21:41:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2444 transitions. [2024-11-08 21:41:22,564 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2444 transitions. Word has length 162 [2024-11-08 21:41:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:22,564 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2444 transitions. [2024-11-08 21:41:22,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2444 transitions. [2024-11-08 21:41:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 21:41:22,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:22,566 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:22,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:41:22,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:22,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 723153316, now seen corresponding path program 1 times [2024-11-08 21:41:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455297907] [2024-11-08 21:41:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455297907] [2024-11-08 21:41:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455297907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368841572] [2024-11-08 21:41:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:22,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:22,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:22,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:22,916 INFO L87 Difference]: Start difference. First operand 1547 states and 2444 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:23,123 INFO L93 Difference]: Finished difference Result 4650 states and 7356 transitions. [2024-11-08 21:41:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-08 21:41:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:23,139 INFO L225 Difference]: With dead ends: 4650 [2024-11-08 21:41:23,139 INFO L226 Difference]: Without dead ends: 3106 [2024-11-08 21:41:23,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:23,144 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 101 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:23,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 414 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:23,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-11-08 21:41:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3084. [2024-11-08 21:41:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2649 states have (on average 1.5352963382408455) internal successors, (4067), 2663 states have internal predecessors, (4067), 406 states have call successors, (406), 28 states have call predecessors, (406), 28 states have return successors, (406), 392 states have call predecessors, (406), 406 states have call successors, (406) [2024-11-08 21:41:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 4879 transitions. [2024-11-08 21:41:23,284 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 4879 transitions. Word has length 162 [2024-11-08 21:41:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:23,284 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 4879 transitions. [2024-11-08 21:41:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 4879 transitions. [2024-11-08 21:41:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 21:41:23,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:23,287 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:23,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:41:23,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 806280831, now seen corresponding path program 1 times [2024-11-08 21:41:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859814953] [2024-11-08 21:41:23,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:41:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859814953] [2024-11-08 21:41:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859814953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765595364] [2024-11-08 21:41:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:24,673 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-08 21:41:24,673 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-08 21:41:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:24,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:41:24,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:25,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:41:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765595364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:41:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-08 21:41:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079931201] [2024-11-08 21:41:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:41:25,041 INFO L87 Difference]: Start difference. First operand 3084 states and 4879 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:26,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:26,188 INFO L93 Difference]: Finished difference Result 7370 states and 11505 transitions. [2024-11-08 21:41:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2024-11-08 21:41:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:26,205 INFO L225 Difference]: With dead ends: 7370 [2024-11-08 21:41:26,206 INFO L226 Difference]: Without dead ends: 4289 [2024-11-08 21:41:26,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:41:26,214 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:26,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 430 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 21:41:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2024-11-08 21:41:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4259. [2024-11-08 21:41:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3740 states have (on average 1.5112299465240642) internal successors, (5652), 3782 states have internal predecessors, (5652), 462 states have call successors, (462), 56 states have call predecessors, (462), 56 states have return successors, (462), 420 states have call predecessors, (462), 462 states have call successors, (462) [2024-11-08 21:41:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6576 transitions. [2024-11-08 21:41:26,422 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6576 transitions. Word has length 163 [2024-11-08 21:41:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:26,423 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6576 transitions. [2024-11-08 21:41:26,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:26,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6576 transitions. [2024-11-08 21:41:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 21:41:26,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:26,426 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:26,442 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-08 21:41:26,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:26,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -623642279, now seen corresponding path program 1 times [2024-11-08 21:41:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353282388] [2024-11-08 21:41:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:26,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:26,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353282388] [2024-11-08 21:41:26,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353282388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:26,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:26,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:26,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392404910] [2024-11-08 21:41:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:26,997 INFO L87 Difference]: Start difference. First operand 4259 states and 6576 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:27,274 INFO L93 Difference]: Finished difference Result 8560 states and 13205 transitions. [2024-11-08 21:41:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2024-11-08 21:41:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:27,292 INFO L225 Difference]: With dead ends: 8560 [2024-11-08 21:41:27,292 INFO L226 Difference]: Without dead ends: 4304 [2024-11-08 21:41:27,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:27,302 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 99 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:27,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 415 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4304 states. [2024-11-08 21:41:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4304 to 4271. [2024-11-08 21:41:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3752 states have (on average 1.5087953091684434) internal successors, (5661), 3794 states have internal predecessors, (5661), 462 states have call successors, (462), 56 states have call predecessors, (462), 56 states have return successors, (462), 420 states have call predecessors, (462), 462 states have call successors, (462) [2024-11-08 21:41:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 6585 transitions. [2024-11-08 21:41:27,459 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 6585 transitions. Word has length 163 [2024-11-08 21:41:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:27,459 INFO L471 AbstractCegarLoop]: Abstraction has 4271 states and 6585 transitions. [2024-11-08 21:41:27,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 6585 transitions. [2024-11-08 21:41:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:41:27,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:27,462 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:27,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:41:27,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:27,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1080767375, now seen corresponding path program 1 times [2024-11-08 21:41:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306819115] [2024-11-08 21:41:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306819115] [2024-11-08 21:41:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306819115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022040112] [2024-11-08 21:41:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:27,657 INFO L87 Difference]: Start difference. First operand 4271 states and 6585 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:28,126 INFO L93 Difference]: Finished difference Result 10427 states and 16126 transitions. [2024-11-08 21:41:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:28,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2024-11-08 21:41:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:28,163 INFO L225 Difference]: With dead ends: 10427 [2024-11-08 21:41:28,164 INFO L226 Difference]: Without dead ends: 7505 [2024-11-08 21:41:28,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:28,175 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 452 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:28,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 518 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:41:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7505 states. [2024-11-08 21:41:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7505 to 6979. [2024-11-08 21:41:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6979 states, 6164 states have (on average 1.5111940298507462) internal successors, (9315), 6230 states have internal predecessors, (9315), 726 states have call successors, (726), 88 states have call predecessors, (726), 88 states have return successors, (726), 660 states have call predecessors, (726), 726 states have call successors, (726) [2024-11-08 21:41:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 10767 transitions. [2024-11-08 21:41:28,625 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 10767 transitions. Word has length 164 [2024-11-08 21:41:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 6979 states and 10767 transitions. [2024-11-08 21:41:28,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 10767 transitions. [2024-11-08 21:41:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:41:28,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:28,638 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:41:28,638 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1214780881, now seen corresponding path program 1 times [2024-11-08 21:41:28,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204007321] [2024-11-08 21:41:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204007321] [2024-11-08 21:41:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204007321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:41:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353479529] [2024-11-08 21:41:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:28,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:41:28,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:41:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:41:28,904 INFO L87 Difference]: Start difference. First operand 6979 states and 10767 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:29,349 INFO L93 Difference]: Finished difference Result 12050 states and 18611 transitions. [2024-11-08 21:41:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 164 [2024-11-08 21:41:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:29,373 INFO L225 Difference]: With dead ends: 12050 [2024-11-08 21:41:29,374 INFO L226 Difference]: Without dead ends: 7046 [2024-11-08 21:41:29,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:41:29,387 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 322 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:29,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 663 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states. [2024-11-08 21:41:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 6991. [2024-11-08 21:41:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6991 states, 6176 states have (on average 1.5092292746113989) internal successors, (9321), 6242 states have internal predecessors, (9321), 726 states have call successors, (726), 88 states have call predecessors, (726), 88 states have return successors, (726), 660 states have call predecessors, (726), 726 states have call successors, (726) [2024-11-08 21:41:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 10773 transitions. [2024-11-08 21:41:29,753 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 10773 transitions. Word has length 164 [2024-11-08 21:41:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 6991 states and 10773 transitions. [2024-11-08 21:41:29,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 10773 transitions. [2024-11-08 21:41:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:41:29,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:29,765 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 21:41:29,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:29,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2022198509, now seen corresponding path program 1 times [2024-11-08 21:41:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:29,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976510186] [2024-11-08 21:41:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976510186] [2024-11-08 21:41:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976510186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433059858] [2024-11-08 21:41:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:30,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:30,025 INFO L87 Difference]: Start difference. First operand 6991 states and 10773 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:30,531 INFO L93 Difference]: Finished difference Result 15256 states and 23595 transitions. [2024-11-08 21:41:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2024-11-08 21:41:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:30,561 INFO L225 Difference]: With dead ends: 15256 [2024-11-08 21:41:30,562 INFO L226 Difference]: Without dead ends: 10166 [2024-11-08 21:41:30,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:41:30,569 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 307 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:30,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 614 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10166 states. [2024-11-08 21:41:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10166 to 9298. [2024-11-08 21:41:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9298 states, 8261 states have (on average 1.5103498365815275) internal successors, (12477), 8345 states have internal predecessors, (12477), 924 states have call successors, (924), 112 states have call predecessors, (924), 112 states have return successors, (924), 840 states have call predecessors, (924), 924 states have call successors, (924) [2024-11-08 21:41:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 14325 transitions. [2024-11-08 21:41:30,893 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 14325 transitions. Word has length 164 [2024-11-08 21:41:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 9298 states and 14325 transitions. [2024-11-08 21:41:30,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 14325 transitions. [2024-11-08 21:41:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 21:41:30,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:30,897 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:30,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 21:41:30,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:30,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2005290346, now seen corresponding path program 1 times [2024-11-08 21:41:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148810151] [2024-11-08 21:41:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:41:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148810151] [2024-11-08 21:41:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148810151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269037571] [2024-11-08 21:41:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:31,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:31,736 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-08 21:41:31,737 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-08 21:41:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:31,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 21:41:31,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 609 proven. 54 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-08 21:41:32,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:41:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:41:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269037571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:41:32,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:41:32,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 18 [2024-11-08 21:41:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437532983] [2024-11-08 21:41:32,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:41:32,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 21:41:32,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 21:41:32,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-08 21:41:32,774 INFO L87 Difference]: Start difference. First operand 9298 states and 14325 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-08 21:41:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:37,106 INFO L93 Difference]: Finished difference Result 32553 states and 48625 transitions. [2024-11-08 21:41:37,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-08 21:41:37,107 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) Word has length 164 [2024-11-08 21:41:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:37,178 INFO L225 Difference]: With dead ends: 32553 [2024-11-08 21:41:37,178 INFO L226 Difference]: Without dead ends: 23162 [2024-11-08 21:41:37,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1699 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1309, Invalid=4093, Unknown=0, NotChecked=0, Total=5402 [2024-11-08 21:41:37,205 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 2237 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:37,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 1172 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 21:41:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23162 states. [2024-11-08 21:41:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23162 to 12069. [2024-11-08 21:41:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12069 states, 10356 states have (on average 1.4420625724217844) internal successors, (14934), 10497 states have internal predecessors, (14934), 1424 states have call successors, (1424), 288 states have call predecessors, (1424), 288 states have return successors, (1424), 1283 states have call predecessors, (1424), 1424 states have call successors, (1424) [2024-11-08 21:41:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12069 states to 12069 states and 17782 transitions. [2024-11-08 21:41:38,132 INFO L78 Accepts]: Start accepts. Automaton has 12069 states and 17782 transitions. Word has length 164 [2024-11-08 21:41:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 12069 states and 17782 transitions. [2024-11-08 21:41:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 5 states have call successors, (42), 3 states have call predecessors, (42), 6 states have return successors, (44), 5 states have call predecessors, (44), 5 states have call successors, (44) [2024-11-08 21:41:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12069 states and 17782 transitions. [2024-11-08 21:41:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:41:38,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:38,139 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:38,158 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-08 21:41:38,339 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,SelfDestructingSolverStorable12 [2024-11-08 21:41:38,339 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 275057401, now seen corresponding path program 1 times [2024-11-08 21:41:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957523761] [2024-11-08 21:41:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:38,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957523761] [2024-11-08 21:41:38,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957523761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:38,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:38,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541461594] [2024-11-08 21:41:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:38,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:38,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:38,636 INFO L87 Difference]: Start difference. First operand 12069 states and 17782 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:39,485 INFO L93 Difference]: Finished difference Result 29862 states and 44112 transitions. [2024-11-08 21:41:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2024-11-08 21:41:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:39,539 INFO L225 Difference]: With dead ends: 29862 [2024-11-08 21:41:39,539 INFO L226 Difference]: Without dead ends: 17544 [2024-11-08 21:41:39,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:39,565 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 225 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:39,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 628 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:41:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17544 states. [2024-11-08 21:41:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17544 to 11475. [2024-11-08 21:41:40,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11475 states, 9840 states have (on average 1.4465447154471545) internal successors, (14234), 9975 states have internal predecessors, (14234), 1358 states have call successors, (1358), 276 states have call predecessors, (1358), 276 states have return successors, (1358), 1223 states have call predecessors, (1358), 1358 states have call successors, (1358) [2024-11-08 21:41:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 16950 transitions. [2024-11-08 21:41:40,574 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 16950 transitions. Word has length 165 [2024-11-08 21:41:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:40,574 INFO L471 AbstractCegarLoop]: Abstraction has 11475 states and 16950 transitions. [2024-11-08 21:41:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 16950 transitions. [2024-11-08 21:41:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:41:40,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:40,578 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 21:41:40,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash 337097015, now seen corresponding path program 1 times [2024-11-08 21:41:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104022761] [2024-11-08 21:41:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104022761] [2024-11-08 21:41:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104022761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:41:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096561464] [2024-11-08 21:41:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:40,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:41:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:41:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:41:40,958 INFO L87 Difference]: Start difference. First operand 11475 states and 16950 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:41,644 INFO L93 Difference]: Finished difference Result 22939 states and 33886 transitions. [2024-11-08 21:41:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2024-11-08 21:41:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:41,683 INFO L225 Difference]: With dead ends: 22939 [2024-11-08 21:41:41,684 INFO L226 Difference]: Without dead ends: 11485 [2024-11-08 21:41:41,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:41:41,706 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 184 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:41,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 571 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states. [2024-11-08 21:41:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 11479. [2024-11-08 21:41:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11479 states, 9844 states have (on average 1.446160097521333) internal successors, (14236), 9979 states have internal predecessors, (14236), 1358 states have call successors, (1358), 276 states have call predecessors, (1358), 276 states have return successors, (1358), 1223 states have call predecessors, (1358), 1358 states have call successors, (1358) [2024-11-08 21:41:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11479 states to 11479 states and 16952 transitions. [2024-11-08 21:41:42,385 INFO L78 Accepts]: Start accepts. Automaton has 11479 states and 16952 transitions. Word has length 165 [2024-11-08 21:41:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:42,385 INFO L471 AbstractCegarLoop]: Abstraction has 11479 states and 16952 transitions. [2024-11-08 21:41:42,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11479 states and 16952 transitions. [2024-11-08 21:41:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:41:42,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:42,388 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:42,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 21:41:42,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1524793035, now seen corresponding path program 1 times [2024-11-08 21:41:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713042239] [2024-11-08 21:41:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:42,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713042239] [2024-11-08 21:41:42,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713042239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:42,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:42,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:42,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585760738] [2024-11-08 21:41:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:42,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:42,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:42,624 INFO L87 Difference]: Start difference. First operand 11479 states and 16952 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:43,520 INFO L93 Difference]: Finished difference Result 22017 states and 32462 transitions. [2024-11-08 21:41:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:43,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 165 [2024-11-08 21:41:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:43,568 INFO L225 Difference]: With dead ends: 22017 [2024-11-08 21:41:43,568 INFO L226 Difference]: Without dead ends: 16284 [2024-11-08 21:41:43,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:41:43,583 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 156 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:43,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 574 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16284 states. [2024-11-08 21:41:44,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16284 to 13756. [2024-11-08 21:41:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13756 states, 11800 states have (on average 1.4452542372881356) internal successors, (17054), 11962 states have internal predecessors, (17054), 1625 states have call successors, (1625), 330 states have call predecessors, (1625), 330 states have return successors, (1625), 1463 states have call predecessors, (1625), 1625 states have call successors, (1625) [2024-11-08 21:41:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13756 states to 13756 states and 20304 transitions. [2024-11-08 21:41:44,438 INFO L78 Accepts]: Start accepts. Automaton has 13756 states and 20304 transitions. Word has length 165 [2024-11-08 21:41:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:44,438 INFO L471 AbstractCegarLoop]: Abstraction has 13756 states and 20304 transitions. [2024-11-08 21:41:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13756 states and 20304 transitions. [2024-11-08 21:41:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 21:41:44,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:44,441 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:44,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 21:41:44,441 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -151331884, now seen corresponding path program 1 times [2024-11-08 21:41:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556832805] [2024-11-08 21:41:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:44,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:44,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556832805] [2024-11-08 21:41:44,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556832805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:44,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813818198] [2024-11-08 21:41:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:44,673 INFO L87 Difference]: Start difference. First operand 13756 states and 20304 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:45,402 INFO L93 Difference]: Finished difference Result 24665 states and 36534 transitions. [2024-11-08 21:41:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:45,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-11-08 21:41:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:45,446 INFO L225 Difference]: With dead ends: 24665 [2024-11-08 21:41:45,446 INFO L226 Difference]: Without dead ends: 13762 [2024-11-08 21:41:45,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:41:45,465 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 92 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:45,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 537 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2024-11-08 21:41:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13752. [2024-11-08 21:41:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13752 states, 11796 states have (on average 1.4452356731095286) internal successors, (17048), 11958 states have internal predecessors, (17048), 1625 states have call successors, (1625), 330 states have call predecessors, (1625), 330 states have return successors, (1625), 1463 states have call predecessors, (1625), 1625 states have call successors, (1625) [2024-11-08 21:41:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13752 states to 13752 states and 20298 transitions. [2024-11-08 21:41:46,701 INFO L78 Accepts]: Start accepts. Automaton has 13752 states and 20298 transitions. Word has length 166 [2024-11-08 21:41:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:46,702 INFO L471 AbstractCegarLoop]: Abstraction has 13752 states and 20298 transitions. [2024-11-08 21:41:46,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 13752 states and 20298 transitions. [2024-11-08 21:41:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 21:41:46,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:46,706 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:46,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 21:41:46,706 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:46,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:46,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1485486184, now seen corresponding path program 1 times [2024-11-08 21:41:46,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:46,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323695405] [2024-11-08 21:41:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:46,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323695405] [2024-11-08 21:41:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323695405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:41:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936639128] [2024-11-08 21:41:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:46,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:41:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:41:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:46,933 INFO L87 Difference]: Start difference. First operand 13752 states and 20298 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:48,419 INFO L93 Difference]: Finished difference Result 23929 states and 35405 transitions. [2024-11-08 21:41:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:41:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-11-08 21:41:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:48,464 INFO L225 Difference]: With dead ends: 23929 [2024-11-08 21:41:48,464 INFO L226 Difference]: Without dead ends: 17627 [2024-11-08 21:41:48,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:41:48,476 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 155 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:48,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:41:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2024-11-08 21:41:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 15848. [2024-11-08 21:41:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15848 states, 13595 states have (on average 1.4502390584773814) internal successors, (19716), 13781 states have internal predecessors, (19716), 1874 states have call successors, (1874), 378 states have call predecessors, (1874), 378 states have return successors, (1874), 1688 states have call predecessors, (1874), 1874 states have call successors, (1874) [2024-11-08 21:41:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 23464 transitions. [2024-11-08 21:41:49,271 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 23464 transitions. Word has length 166 [2024-11-08 21:41:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:49,271 INFO L471 AbstractCegarLoop]: Abstraction has 15848 states and 23464 transitions. [2024-11-08 21:41:49,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 21:41:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 23464 transitions. [2024-11-08 21:41:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 21:41:49,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:49,273 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:49,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 21:41:49,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:49,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:49,274 INFO L85 PathProgramCache]: Analyzing trace with hash -356105936, now seen corresponding path program 1 times [2024-11-08 21:41:49,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073648326] [2024-11-08 21:41:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 21:41:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:50,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073648326] [2024-11-08 21:41:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073648326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:50,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 21:41:50,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329013620] [2024-11-08 21:41:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:50,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 21:41:50,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 21:41:50,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 21:41:50,349 INFO L87 Difference]: Start difference. First operand 15848 states and 23464 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:53,619 INFO L93 Difference]: Finished difference Result 56103 states and 82410 transitions. [2024-11-08 21:41:53,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 21:41:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-11-08 21:41:53,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:53,727 INFO L225 Difference]: With dead ends: 56103 [2024-11-08 21:41:53,727 INFO L226 Difference]: Without dead ends: 40276 [2024-11-08 21:41:53,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:41:53,758 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 927 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:53,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 573 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:41:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2024-11-08 21:41:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 33153. [2024-11-08 21:41:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33153 states, 28737 states have (on average 1.4636531301110067) internal successors, (42061), 29090 states have internal predecessors, (42061), 3670 states have call successors, (3670), 745 states have call predecessors, (3670), 745 states have return successors, (3670), 3317 states have call predecessors, (3670), 3670 states have call successors, (3670) [2024-11-08 21:41:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33153 states to 33153 states and 49401 transitions. [2024-11-08 21:41:56,660 INFO L78 Accepts]: Start accepts. Automaton has 33153 states and 49401 transitions. Word has length 166 [2024-11-08 21:41:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:56,660 INFO L471 AbstractCegarLoop]: Abstraction has 33153 states and 49401 transitions. [2024-11-08 21:41:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:41:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 33153 states and 49401 transitions. [2024-11-08 21:41:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 21:41:56,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:56,664 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:41:56,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 21:41:56,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1165452562, now seen corresponding path program 1 times [2024-11-08 21:41:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396568003] [2024-11-08 21:41:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:41:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:41:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:41:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:41:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:41:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:41:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:41:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:41:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:41:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:41:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:41:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:41:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:41:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396568003] [2024-11-08 21:41:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396568003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:41:57,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610893133] [2024-11-08 21:41:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:57,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:41:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:57,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:41:57,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:41:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:57,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:41:57,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:41:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-11-08 21:41:57,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:41:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 21:41:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610893133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:41:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:41:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 21:41:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896321912] [2024-11-08 21:41:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:41:57,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:41:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:41:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:41:57,341 INFO L87 Difference]: Start difference. First operand 33153 states and 49401 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-08 21:42:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:00,236 INFO L93 Difference]: Finished difference Result 76294 states and 113055 transitions. [2024-11-08 21:42:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 21:42:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 166 [2024-11-08 21:42:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:00,341 INFO L225 Difference]: With dead ends: 76294 [2024-11-08 21:42:00,341 INFO L226 Difference]: Without dead ends: 41857 [2024-11-08 21:42:00,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2024-11-08 21:42:00,388 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 345 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:42:00,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 608 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:42:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41857 states. [2024-11-08 21:42:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41857 to 32524. [2024-11-08 21:42:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32524 states, 27853 states have (on average 1.4188058736940365) internal successors, (39518), 28224 states have internal predecessors, (39518), 3796 states have call successors, (3796), 874 states have call predecessors, (3796), 874 states have return successors, (3796), 3425 states have call predecessors, (3796), 3796 states have call successors, (3796) [2024-11-08 21:42:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32524 states to 32524 states and 47110 transitions. [2024-11-08 21:42:03,536 INFO L78 Accepts]: Start accepts. Automaton has 32524 states and 47110 transitions. Word has length 166 [2024-11-08 21:42:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:03,536 INFO L471 AbstractCegarLoop]: Abstraction has 32524 states and 47110 transitions. [2024-11-08 21:42:03,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-08 21:42:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32524 states and 47110 transitions. [2024-11-08 21:42:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:42:03,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:03,539 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:03,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:42:03,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:03,740 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:03,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:03,741 INFO L85 PathProgramCache]: Analyzing trace with hash -754655283, now seen corresponding path program 1 times [2024-11-08 21:42:03,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:42:03,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659480898] [2024-11-08 21:42:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:42:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:42:03,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98301073] [2024-11-08 21:42:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:03,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:42:03,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 21:42:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:42:03,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:42:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:42:04,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:42:04,071 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:42:04,072 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:42:04,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 21:42:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:42:04,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:42:04,360 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:42:04,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:42:04 BoogieIcfgContainer [2024-11-08 21:42:04,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:42:04,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:42:04,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:42:04,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:42:04,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:19" (3/4) ... [2024-11-08 21:42:04,364 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:42:04,365 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:42:04,366 INFO L158 Benchmark]: Toolchain (without parser) took 46696.21ms. Allocated memory was 153.1MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 80.6MB in the beginning and 5.2GB in the end (delta: -5.2GB). Peak memory consumption was 724.1MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,366 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:42:04,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.08ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 63.4MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.38ms. Allocated memory is still 153.1MB. Free memory was 63.4MB in the beginning and 58.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,367 INFO L158 Benchmark]: Boogie Preprocessor took 152.08ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 58.3MB in the beginning and 182.9MB in the end (delta: -124.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,367 INFO L158 Benchmark]: RCFGBuilder took 751.75ms. Allocated memory is still 216.0MB. Free memory was 182.9MB in the beginning and 149.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,368 INFO L158 Benchmark]: TraceAbstraction took 45335.00ms. Allocated memory was 216.0MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 148.3MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 727.1MB. Max. memory is 16.1GB. [2024-11-08 21:42:04,368 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 6.0GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:42:04,369 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.08ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 63.4MB in the end (delta: 17.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.38ms. Allocated memory is still 153.1MB. Free memory was 63.4MB in the beginning and 58.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.08ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 58.3MB in the beginning and 182.9MB in the end (delta: -124.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * RCFGBuilder took 751.75ms. Allocated memory is still 216.0MB. Free memory was 182.9MB in the beginning and 149.4MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45335.00ms. Allocated memory was 216.0MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 148.3MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 727.1MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 6.0GB. Free memory is still 5.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of bitwiseOr at line 116, overapproximation of bitwiseAnd at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] double var_1_32 = 0.0; [L41] unsigned short int var_1_34 = 34858; [L42] unsigned short int var_1_35 = 41225; [L43] double var_1_37 = 63.63; [L44] signed char var_1_39 = 10; [L45] signed char var_1_40 = -25; [L46] signed char var_1_41 = 4; [L47] unsigned char var_1_42 = 50; [L48] unsigned long int last_1_var_1_10 = 256; [L49] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L171] last_1_var_1_10 = var_1_10 [L172] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=1, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L182] RET updateLastVariables() [L183] CALL updateVariables() [L134] var_1_3 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L137] var_1_5 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L138] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L139] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L139] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L140] var_1_13 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L141] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L142] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L143] var_1_14 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L144] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L145] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L146] var_1_15 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L148] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L149] var_1_16 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L151] var_1_21 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L152] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L153] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L154] var_1_22 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L155] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L156] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L156] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L157] var_1_34 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L159] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L160] var_1_35 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L161] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L162] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L163] var_1_40 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L164] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L165] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=16, var_1_6=256] [L166] var_1_41 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L167] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L168] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L168] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L183] RET updateVariables() [L184] CALL step() [L53] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L58] COND FALSE !(var_1_20 > var_1_21) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L71] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L72] COND TRUE stepLocal_2 > last_1_var_1_10 [L73] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L75] var_1_28 = var_1_5 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L76] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L77] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L81] COND FALSE !(var_1_14 >= ((((var_1_20) > (var_1_6)) ? (var_1_20) : (var_1_6)))) [L84] var_1_24 = (((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L86] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L87] COND FALSE !(stepLocal_1 || var_1_3) [L92] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L94] EXPR var_1_14 ^ var_1_21 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=-4, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L94] COND TRUE ((var_1_14 ^ var_1_21) % var_1_21) > -10 [L95] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L97] EXPR var_1_35 & var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L97] EXPR (var_1_35 & var_1_20) >> var_1_14 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L97] COND TRUE var_1_14 >= ((var_1_35 & var_1_20) >> var_1_14) [L98] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L100] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L111] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L116] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L116] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L117] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L122] EXPR ((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=0, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L122] COND FALSE !((~ var_1_23) <= (((((var_1_5) > (-16)) ? (var_1_5) : (-16))) & 16)) [L125] COND TRUE var_1_10 <= (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) [L126] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L131] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=128, var_1_22=127, var_1_23=64, var_1_24=256, var_1_28=16, var_1_30=135, var_1_32=2, var_1_34=-32769, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=16, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 21, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6801 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6770 mSDsluCounter, 10640 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6611 mSDsCounter, 1110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4647 IncrementalHoareTripleChecker+Invalid, 5757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1110 mSolverCounterUnsat, 4029 mSDtfsCounter, 4647 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1970 GetRequests, 1812 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1754 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33153occurred in iteration=19, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 39992 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 4098 NumberOfCodeBlocks, 4098 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4067 ConstructedInterpolants, 19 QuantifiedInterpolants, 15318 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1165 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 25129/25300 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-08 21:42:04,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.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 a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:42:07,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:42:07,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:42:07,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:42:07,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:42:07,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:42:07,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:42:07,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:42:07,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:42:07,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:42:07,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:42:07,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:42:07,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:42:07,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:42:07,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:42:07,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:42:07,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:42:07,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:42:07,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:42:07,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:42:07,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:42:07,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:42:07,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:42:07,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:42:07,156 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:42:07,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:42:07,157 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:42:07,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:42:07,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:42:07,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:42:07,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:42:07,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:42:07,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:42:07,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:42:07,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:42:07,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:42:07,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:42:07,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:42:07,159 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:42:07,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:42:07,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:42:07,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:42:07,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:42:07,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:42:07,162 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 -> a3cca5fe1c4a9c3c279c334386b8da0cee2c5ffb5715bbf5bb62146dfa62dbb5 [2024-11-08 21:42:07,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:42:07,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:42:07,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:42:07,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:42:07,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:42:07,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:42:08,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:42:08,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:42:08,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:42:08,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f013c255c/e121ec137f834e3e83c5232c9759268b/FLAG430ec4263 [2024-11-08 21:42:08,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f013c255c/e121ec137f834e3e83c5232c9759268b [2024-11-08 21:42:08,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:42:08,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:42:08,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:42:08,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:42:08,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:42:08,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:42:08" (1/1) ... [2024-11-08 21:42:08,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9e93d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:08, skipping insertion in model container [2024-11-08 21:42:08,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:42:08" (1/1) ... [2024-11-08 21:42:08,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:42:09,115 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2024-11-08 21:42:09,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:42:09,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:42:09,208 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_fillercode_fillercodestructure_filler-pr-ci_file-3.i[918,931] [2024-11-08 21:42:09,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:42:09,295 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:42:09,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09 WrapperNode [2024-11-08 21:42:09,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:42:09,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:42:09,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:42:09,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:42:09,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,372 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-08 21:42:09,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:42:09,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:42:09,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:42:09,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:42:09,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,409 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-08 21:42:09,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:42:09,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:42:09,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:42:09,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:42:09,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (1/1) ... [2024-11-08 21:42:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:42:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:42:09,482 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-08 21:42:09,499 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-08 21:42:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:42:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:42:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:42:09,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:42:09,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:42:09,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:42:09,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:42:09,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:42:23,794 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 21:42:23,794 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:42:23,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:42:23,808 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:42:23,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:42:23 BoogieIcfgContainer [2024-11-08 21:42:23,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:42:23,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:42:23,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:42:23,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:42:23,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:42:08" (1/3) ... [2024-11-08 21:42:23,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53e232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:42:23, skipping insertion in model container [2024-11-08 21:42:23,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:42:09" (2/3) ... [2024-11-08 21:42:23,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b53e232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:42:23, skipping insertion in model container [2024-11-08 21:42:23,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:42:23" (3/3) ... [2024-11-08 21:42:23,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-3.i [2024-11-08 21:42:23,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:42:23,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:42:23,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:42:23,906 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;@1aa7ba20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:42:23,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:42:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:42:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 21:42:23,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:23,932 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:23,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:23,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2022594804, now seen corresponding path program 1 times [2024-11-08 21:42:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067425428] [2024-11-08 21:42:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:23,960 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-08 21:42:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:23,966 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-08 21:42:23,966 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-08 21:42:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:25,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:42:25,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-08 21:42:25,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:42:25,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:42:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067425428] [2024-11-08 21:42:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067425428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:42:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:42:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:42:25,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315336539] [2024-11-08 21:42:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:42:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:42:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:42:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:42:25,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:42:25,174 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:42:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:42:25,206 INFO L93 Difference]: Finished difference Result 159 states and 281 transitions. [2024-11-08 21:42:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:42:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-08 21:42:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:42:25,213 INFO L225 Difference]: With dead ends: 159 [2024-11-08 21:42:25,214 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 21:42:25,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-08 21:42:25,220 INFO L432 NwaCegarLoop]: 124 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, 124 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-08 21:42:25,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:42:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 21:42:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 21:42:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 21:42:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2024-11-08 21:42:25,255 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 153 [2024-11-08 21:42:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:42:25,255 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2024-11-08 21:42:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 21:42:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2024-11-08 21:42:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 21:42:25,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:42:25,259 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:42:25,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:42:25,459 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-08 21:42:25,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:42:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:42:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1942170698, now seen corresponding path program 1 times [2024-11-08 21:42:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:42:25,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854163935] [2024-11-08 21:42:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:42:25,462 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-08 21:42:25,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:42:25,468 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-08 21:42:25,474 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-08 21:42:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:42:26,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:42:26,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:42:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 418 proven. 48 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-08 21:42:33,400 INFO L311 TraceCheckSpWp]: Computing backward predicates...