./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:18:01,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:18:01,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:18:01,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:18:01,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:18:01,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:18:01,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:18:01,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:18:01,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:18:01,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:18:01,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:18:01,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:18:01,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:18:01,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:18:01,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:18:01,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:18:01,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:18:01,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:18:01,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:18:01,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:18:01,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:18:01,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:18:01,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:18:01,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:18:01,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:18:01,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:18:01,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:18:01,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:18:01,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:18:01,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:18:01,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:18:01,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:18:01,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:18:01,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:18:01,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:18:01,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:18:01,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:18:01,296 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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-11-20 02:18:01,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:18:01,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:18:01,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:18:01,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:18:01,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:18:01,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:02,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:18:02,931 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:18:02,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:02,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01a9cf69/f37f7102b153424087294d33a617d334/FLAGfa47ed722 [2024-11-20 02:18:03,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01a9cf69/f37f7102b153424087294d33a617d334 [2024-11-20 02:18:03,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:18:03,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:18:03,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:18:03,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:18:03,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:18:03,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70375727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03, skipping insertion in model container [2024-11-20 02:18:03,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:18:03,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-20 02:18:03,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:18:03,583 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:18:03,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-20 02:18:03,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:18:03,637 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:18:03,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03 WrapperNode [2024-11-20 02:18:03,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:18:03,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:18:03,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:18:03,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:18:03,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,705 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-20 02:18:03,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:18:03,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:18:03,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:18:03,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:18:03,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,758 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-20 02:18:03,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:18:03,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:18:03,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:18:03,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:18:03,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (1/1) ... [2024-11-20 02:18:03,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:18:03,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:18:03,815 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-20 02:18:03,830 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-20 02:18:03,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:18:03,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:18:03,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:18:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:18:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:18:03,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:18:03,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:18:03,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:18:04,254 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-20 02:18:04,255 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:18:04,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:18:04,269 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:18:04,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:18:04 BoogieIcfgContainer [2024-11-20 02:18:04,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:18:04,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:18:04,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:18:04,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:18:04,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:18:03" (1/3) ... [2024-11-20 02:18:04,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290601eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:18:04, skipping insertion in model container [2024-11-20 02:18:04,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:03" (2/3) ... [2024-11-20 02:18:04,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290601eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:18:04, skipping insertion in model container [2024-11-20 02:18:04,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:18:04" (3/3) ... [2024-11-20 02:18:04,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:04,290 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:18:04,290 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:18:04,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:18:04,349 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;@40d406bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:18:04,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:18:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 02:18:04,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:04,364 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:04,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:04,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash 145375645, now seen corresponding path program 1 times [2024-11-20 02:18:04,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:04,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665010703] [2024-11-20 02:18:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665010703] [2024-11-20 02:18:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665010703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:18:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261080133] [2024-11-20 02:18:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:18:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:18:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:18:04,740 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 02:18:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:04,790 INFO L93 Difference]: Finished difference Result 137 states and 222 transitions. [2024-11-20 02:18:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:18:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-11-20 02:18:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:04,800 INFO L225 Difference]: With dead ends: 137 [2024-11-20 02:18:04,800 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 02:18:04,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-20 02:18:04,805 INFO L432 NwaCegarLoop]: 99 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, 99 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-20 02:18:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 02:18:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-20 02:18:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-11-20 02:18:04,840 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 116 [2024-11-20 02:18:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:04,840 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-11-20 02:18:04,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 02:18:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-11-20 02:18:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 02:18:04,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:04,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:18:04,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1400101457, now seen corresponding path program 1 times [2024-11-20 02:18:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855212465] [2024-11-20 02:18:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:04,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855212465] [2024-11-20 02:18:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855212465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971175539] [2024-11-20 02:18:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:05,055 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:05,101 INFO L93 Difference]: Finished difference Result 163 states and 238 transitions. [2024-11-20 02:18:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-20 02:18:05,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:05,108 INFO L225 Difference]: With dead ends: 163 [2024-11-20 02:18:05,108 INFO L226 Difference]: Without dead ends: 98 [2024-11-20 02:18:05,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:05,110 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 34 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:05,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 207 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-20 02:18:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2024-11-20 02:18:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-20 02:18:05,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 116 [2024-11-20 02:18:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:05,125 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-20 02:18:05,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-20 02:18:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 02:18:05,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:05,126 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:05,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:18:05,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:05,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2112576145, now seen corresponding path program 1 times [2024-11-20 02:18:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767509291] [2024-11-20 02:18:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:05,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767509291] [2024-11-20 02:18:05,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767509291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:05,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:05,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 02:18:05,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421821167] [2024-11-20 02:18:05,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:05,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:18:05,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:05,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:18:05,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:18:05,889 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:06,748 INFO L93 Difference]: Finished difference Result 386 states and 562 transitions. [2024-11-20 02:18:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:18:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-20 02:18:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:06,751 INFO L225 Difference]: With dead ends: 386 [2024-11-20 02:18:06,752 INFO L226 Difference]: Without dead ends: 308 [2024-11-20 02:18:06,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:18:06,753 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 265 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:06,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 565 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:18:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-20 02:18:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 178. [2024-11-20 02:18:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 143 states have (on average 1.3986013986013985) internal successors, (200), 143 states have internal predecessors, (200), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 02:18:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2024-11-20 02:18:06,791 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 116 [2024-11-20 02:18:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:06,791 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2024-11-20 02:18:06,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2024-11-20 02:18:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 02:18:06,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:06,795 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:06,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:18:06,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:06,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1364742701, now seen corresponding path program 1 times [2024-11-20 02:18:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:06,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575478310] [2024-11-20 02:18:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575478310] [2024-11-20 02:18:07,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575478310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:18:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038042425] [2024-11-20 02:18:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:07,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:18:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:18:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:18:07,098 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:07,651 INFO L93 Difference]: Finished difference Result 1022 states and 1512 transitions. [2024-11-20 02:18:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 02:18:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-20 02:18:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:07,660 INFO L225 Difference]: With dead ends: 1022 [2024-11-20 02:18:07,660 INFO L226 Difference]: Without dead ends: 847 [2024-11-20 02:18:07,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:18:07,664 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 366 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:07,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 949 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:18:07,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-20 02:18:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 441. [2024-11-20 02:18:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 372 states have internal predecessors, (524), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 652 transitions. [2024-11-20 02:18:07,732 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 652 transitions. Word has length 116 [2024-11-20 02:18:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:07,733 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 652 transitions. [2024-11-20 02:18:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 652 transitions. [2024-11-20 02:18:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 02:18:07,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:07,739 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:07,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:18:07,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:07,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1919107345, now seen corresponding path program 1 times [2024-11-20 02:18:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:07,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962048774] [2024-11-20 02:18:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962048774] [2024-11-20 02:18:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962048774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:08,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:18:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058634659] [2024-11-20 02:18:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:08,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:18:08,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:08,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:18:08,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:18:08,068 INFO L87 Difference]: Start difference. First operand 441 states and 652 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:08,469 INFO L93 Difference]: Finished difference Result 1020 states and 1489 transitions. [2024-11-20 02:18:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:18:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-20 02:18:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:08,476 INFO L225 Difference]: With dead ends: 1020 [2024-11-20 02:18:08,476 INFO L226 Difference]: Without dead ends: 799 [2024-11-20 02:18:08,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:18:08,478 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 241 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:08,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 480 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:18:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-20 02:18:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 222. [2024-11-20 02:18:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 187 states have (on average 1.3903743315508021) internal successors, (260), 187 states have internal predecessors, (260), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 02:18:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 324 transitions. [2024-11-20 02:18:08,520 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 324 transitions. Word has length 116 [2024-11-20 02:18:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:08,523 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 324 transitions. [2024-11-20 02:18:08,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 324 transitions. [2024-11-20 02:18:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 02:18:08,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:08,525 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:08,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:18:08,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:08,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1418652826, now seen corresponding path program 1 times [2024-11-20 02:18:08,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:08,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994776755] [2024-11-20 02:18:08,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:08,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994776755] [2024-11-20 02:18:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994776755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:09,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:18:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28604917] [2024-11-20 02:18:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:09,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:18:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:18:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:18:09,118 INFO L87 Difference]: Start difference. First operand 222 states and 324 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:10,055 INFO L93 Difference]: Finished difference Result 1002 states and 1456 transitions. [2024-11-20 02:18:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:18:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-20 02:18:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:10,059 INFO L225 Difference]: With dead ends: 1002 [2024-11-20 02:18:10,059 INFO L226 Difference]: Without dead ends: 782 [2024-11-20 02:18:10,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:18:10,060 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 250 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:10,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1122 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 02:18:10,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-20 02:18:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 465. [2024-11-20 02:18:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 396 states have (on average 1.3964646464646464) internal successors, (553), 396 states have internal predecessors, (553), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 681 transitions. [2024-11-20 02:18:10,107 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 681 transitions. Word has length 117 [2024-11-20 02:18:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:10,107 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 681 transitions. [2024-11-20 02:18:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 681 transitions. [2024-11-20 02:18:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 02:18:10,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:10,108 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:10,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:18:10,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1841354652, now seen corresponding path program 1 times [2024-11-20 02:18:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295010278] [2024-11-20 02:18:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:10,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295010278] [2024-11-20 02:18:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295010278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:18:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681969217] [2024-11-20 02:18:10,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:10,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:18:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:18:10,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:18:10,474 INFO L87 Difference]: Start difference. First operand 465 states and 681 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:10,812 INFO L93 Difference]: Finished difference Result 1141 states and 1664 transitions. [2024-11-20 02:18:10,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:18:10,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-20 02:18:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:10,816 INFO L225 Difference]: With dead ends: 1141 [2024-11-20 02:18:10,816 INFO L226 Difference]: Without dead ends: 679 [2024-11-20 02:18:10,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:18:10,819 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 71 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:10,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 858 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:18:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-20 02:18:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 485. [2024-11-20 02:18:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 416 states have (on average 1.3918269230769231) internal successors, (579), 416 states have internal predecessors, (579), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 707 transitions. [2024-11-20 02:18:10,893 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 707 transitions. Word has length 117 [2024-11-20 02:18:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:10,894 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 707 transitions. [2024-11-20 02:18:10,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 707 transitions. [2024-11-20 02:18:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 02:18:10,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:10,897 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:10,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:18:10,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:10,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1228026897, now seen corresponding path program 1 times [2024-11-20 02:18:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825698889] [2024-11-20 02:18:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825698889] [2024-11-20 02:18:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825698889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:18:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30565181] [2024-11-20 02:18:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:18:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:18:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:18:11,391 INFO L87 Difference]: Start difference. First operand 485 states and 707 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:11,992 INFO L93 Difference]: Finished difference Result 1142 states and 1653 transitions. [2024-11-20 02:18:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:18:11,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-20 02:18:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:11,996 INFO L225 Difference]: With dead ends: 1142 [2024-11-20 02:18:11,997 INFO L226 Difference]: Without dead ends: 660 [2024-11-20 02:18:11,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:18:11,999 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 230 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:11,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 970 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:18:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-20 02:18:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 504. [2024-11-20 02:18:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 435 states have (on average 1.3885057471264368) internal successors, (604), 435 states have internal predecessors, (604), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 732 transitions. [2024-11-20 02:18:12,072 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 732 transitions. Word has length 118 [2024-11-20 02:18:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:12,072 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 732 transitions. [2024-11-20 02:18:12,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 732 transitions. [2024-11-20 02:18:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 02:18:12,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:12,074 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:12,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:18:12,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:12,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -79395406, now seen corresponding path program 1 times [2024-11-20 02:18:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793189083] [2024-11-20 02:18:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793189083] [2024-11-20 02:18:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793189083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:12,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:12,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:18:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995064334] [2024-11-20 02:18:12,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:12,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:18:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:12,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:18:12,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:18:12,343 INFO L87 Difference]: Start difference. First operand 504 states and 732 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:12,652 INFO L93 Difference]: Finished difference Result 1022 states and 1488 transitions. [2024-11-20 02:18:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:18:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-20 02:18:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:12,655 INFO L225 Difference]: With dead ends: 1022 [2024-11-20 02:18:12,655 INFO L226 Difference]: Without dead ends: 519 [2024-11-20 02:18:12,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:18:12,658 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 120 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:12,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 340 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:18:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-20 02:18:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 470. [2024-11-20 02:18:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 401 states have (on average 1.374064837905237) internal successors, (551), 401 states have internal predecessors, (551), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 679 transitions. [2024-11-20 02:18:12,714 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 679 transitions. Word has length 118 [2024-11-20 02:18:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:12,715 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 679 transitions. [2024-11-20 02:18:12,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 679 transitions. [2024-11-20 02:18:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 02:18:12,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:12,716 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:12,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:18:12,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:12,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:12,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1009172179, now seen corresponding path program 1 times [2024-11-20 02:18:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145060084] [2024-11-20 02:18:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145060084] [2024-11-20 02:18:13,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145060084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:13,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:13,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:18:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304041831] [2024-11-20 02:18:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:18:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:18:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:18:13,084 INFO L87 Difference]: Start difference. First operand 470 states and 679 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:13,676 INFO L93 Difference]: Finished difference Result 1047 states and 1492 transitions. [2024-11-20 02:18:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 02:18:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-20 02:18:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:13,682 INFO L225 Difference]: With dead ends: 1047 [2024-11-20 02:18:13,682 INFO L226 Difference]: Without dead ends: 812 [2024-11-20 02:18:13,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:18:13,684 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 230 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:13,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1062 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:18:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-20 02:18:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 490. [2024-11-20 02:18:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 421 states have (on average 1.3752969121140142) internal successors, (579), 421 states have internal predecessors, (579), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 707 transitions. [2024-11-20 02:18:13,761 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 707 transitions. Word has length 118 [2024-11-20 02:18:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:13,763 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 707 transitions. [2024-11-20 02:18:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 707 transitions. [2024-11-20 02:18:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 02:18:13,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:13,764 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:13,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:18:13,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -298250124, now seen corresponding path program 1 times [2024-11-20 02:18:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494620260] [2024-11-20 02:18:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494620260] [2024-11-20 02:18:14,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494620260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:14,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:14,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:18:14,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145170560] [2024-11-20 02:18:14,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:14,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:18:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:14,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:18:14,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:18:14,148 INFO L87 Difference]: Start difference. First operand 490 states and 707 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:14,512 INFO L93 Difference]: Finished difference Result 1249 states and 1754 transitions. [2024-11-20 02:18:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:18:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-20 02:18:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:14,515 INFO L225 Difference]: With dead ends: 1249 [2024-11-20 02:18:14,515 INFO L226 Difference]: Without dead ends: 762 [2024-11-20 02:18:14,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:18:14,517 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:14,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 750 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:18:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-20 02:18:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 498. [2024-11-20 02:18:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 429 states have (on average 1.324009324009324) internal successors, (568), 429 states have internal predecessors, (568), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 696 transitions. [2024-11-20 02:18:14,579 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 696 transitions. Word has length 118 [2024-11-20 02:18:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:14,580 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 696 transitions. [2024-11-20 02:18:14,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 696 transitions. [2024-11-20 02:18:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:14,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:14,581 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:18:14,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -837694830, now seen corresponding path program 1 times [2024-11-20 02:18:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129145044] [2024-11-20 02:18:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:14,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129145044] [2024-11-20 02:18:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129145044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400667819] [2024-11-20 02:18:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:14,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:14,649 INFO L87 Difference]: Start difference. First operand 498 states and 696 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:14,757 INFO L93 Difference]: Finished difference Result 1278 states and 1788 transitions. [2024-11-20 02:18:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:14,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:14,761 INFO L225 Difference]: With dead ends: 1278 [2024-11-20 02:18:14,761 INFO L226 Difference]: Without dead ends: 783 [2024-11-20 02:18:14,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:14,764 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 79 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:14,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 252 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-20 02:18:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 516. [2024-11-20 02:18:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 447 states have (on average 1.313199105145414) internal successors, (587), 447 states have internal predecessors, (587), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 715 transitions. [2024-11-20 02:18:14,828 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 715 transitions. Word has length 119 [2024-11-20 02:18:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:14,829 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 715 transitions. [2024-11-20 02:18:14,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 715 transitions. [2024-11-20 02:18:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:14,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:14,830 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:18:14,831 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:14,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1925779713, now seen corresponding path program 1 times [2024-11-20 02:18:14,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448952408] [2024-11-20 02:18:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448952408] [2024-11-20 02:18:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448952408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442263657] [2024-11-20 02:18:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:14,900 INFO L87 Difference]: Start difference. First operand 516 states and 715 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:15,008 INFO L93 Difference]: Finished difference Result 1211 states and 1680 transitions. [2024-11-20 02:18:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:15,013 INFO L225 Difference]: With dead ends: 1211 [2024-11-20 02:18:15,013 INFO L226 Difference]: Without dead ends: 698 [2024-11-20 02:18:15,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:15,015 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 83 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:15,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 188 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-20 02:18:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 516. [2024-11-20 02:18:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 447 states have (on average 1.3042505592841163) internal successors, (583), 447 states have internal predecessors, (583), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 711 transitions. [2024-11-20 02:18:15,069 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 711 transitions. Word has length 119 [2024-11-20 02:18:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 711 transitions. [2024-11-20 02:18:15,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 711 transitions. [2024-11-20 02:18:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:15,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:15,072 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 02:18:15,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash 377135429, now seen corresponding path program 1 times [2024-11-20 02:18:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184233256] [2024-11-20 02:18:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:15,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184233256] [2024-11-20 02:18:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184233256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:15,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:15,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:15,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712252998] [2024-11-20 02:18:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:15,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:15,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:15,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:15,133 INFO L87 Difference]: Start difference. First operand 516 states and 711 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:15,268 INFO L93 Difference]: Finished difference Result 1377 states and 1906 transitions. [2024-11-20 02:18:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:15,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:15,272 INFO L225 Difference]: With dead ends: 1377 [2024-11-20 02:18:15,272 INFO L226 Difference]: Without dead ends: 864 [2024-11-20 02:18:15,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:15,274 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 92 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:15,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-20 02:18:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 524. [2024-11-20 02:18:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 455 states have (on average 1.298901098901099) internal successors, (591), 455 states have internal predecessors, (591), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 719 transitions. [2024-11-20 02:18:15,331 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 719 transitions. Word has length 119 [2024-11-20 02:18:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 719 transitions. [2024-11-20 02:18:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 719 transitions. [2024-11-20 02:18:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:15,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:15,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 02:18:15,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 635300867, now seen corresponding path program 1 times [2024-11-20 02:18:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889766532] [2024-11-20 02:18:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889766532] [2024-11-20 02:18:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889766532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:18:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991812977] [2024-11-20 02:18:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:18:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:18:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:18:15,582 INFO L87 Difference]: Start difference. First operand 524 states and 719 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:15,843 INFO L93 Difference]: Finished difference Result 1068 states and 1420 transitions. [2024-11-20 02:18:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:18:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:15,847 INFO L225 Difference]: With dead ends: 1068 [2024-11-20 02:18:15,847 INFO L226 Difference]: Without dead ends: 789 [2024-11-20 02:18:15,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:18:15,850 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 81 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:15,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 624 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:18:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-20 02:18:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 522. [2024-11-20 02:18:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 453 states have (on average 1.2958057395143487) internal successors, (587), 453 states have internal predecessors, (587), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 02:18:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 715 transitions. [2024-11-20 02:18:15,904 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 715 transitions. Word has length 119 [2024-11-20 02:18:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:15,905 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 715 transitions. [2024-11-20 02:18:15,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 715 transitions. [2024-11-20 02:18:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:15,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:15,907 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 02:18:15,907 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:15,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1703919601, now seen corresponding path program 1 times [2024-11-20 02:18:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997193443] [2024-11-20 02:18:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997193443] [2024-11-20 02:18:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997193443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:18:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486678571] [2024-11-20 02:18:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:16,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:18:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:18:16,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:18:16,366 INFO L87 Difference]: Start difference. First operand 522 states and 715 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:16,570 INFO L93 Difference]: Finished difference Result 1056 states and 1429 transitions. [2024-11-20 02:18:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:18:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:16,573 INFO L225 Difference]: With dead ends: 1056 [2024-11-20 02:18:16,573 INFO L226 Difference]: Without dead ends: 779 [2024-11-20 02:18:16,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:18:16,575 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:16,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 301 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:18:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-20 02:18:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 774. [2024-11-20 02:18:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 687 states have (on average 1.2940320232896652) internal successors, (889), 690 states have internal predecessors, (889), 76 states have call successors, (76), 10 states have call predecessors, (76), 10 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-20 02:18:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1041 transitions. [2024-11-20 02:18:16,656 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1041 transitions. Word has length 119 [2024-11-20 02:18:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:16,656 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1041 transitions. [2024-11-20 02:18:16,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1041 transitions. [2024-11-20 02:18:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:16,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:16,658 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 02:18:16,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 115571699, now seen corresponding path program 1 times [2024-11-20 02:18:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912893326] [2024-11-20 02:18:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912893326] [2024-11-20 02:18:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912893326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:18:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062448971] [2024-11-20 02:18:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:18:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:18:17,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:18:17,025 INFO L87 Difference]: Start difference. First operand 774 states and 1041 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:17,542 INFO L93 Difference]: Finished difference Result 1950 states and 2569 transitions. [2024-11-20 02:18:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:18:17,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:17,548 INFO L225 Difference]: With dead ends: 1950 [2024-11-20 02:18:17,548 INFO L226 Difference]: Without dead ends: 1194 [2024-11-20 02:18:17,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:18:17,550 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 205 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:17,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1030 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:18:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-20 02:18:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 812. [2024-11-20 02:18:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 712 states have (on average 1.2879213483146068) internal successors, (917), 715 states have internal predecessors, (917), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 02:18:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1093 transitions. [2024-11-20 02:18:17,647 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1093 transitions. Word has length 119 [2024-11-20 02:18:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:17,648 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1093 transitions. [2024-11-20 02:18:17,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1093 transitions. [2024-11-20 02:18:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:17,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:17,650 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:17,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 02:18:17,650 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:17,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -746889072, now seen corresponding path program 1 times [2024-11-20 02:18:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:17,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590876494] [2024-11-20 02:18:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:17,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:17,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590876494] [2024-11-20 02:18:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590876494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:17,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:17,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039724321] [2024-11-20 02:18:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:17,721 INFO L87 Difference]: Start difference. First operand 812 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:17,873 INFO L93 Difference]: Finished difference Result 1997 states and 2696 transitions. [2024-11-20 02:18:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:17,878 INFO L225 Difference]: With dead ends: 1997 [2024-11-20 02:18:17,878 INFO L226 Difference]: Without dead ends: 1222 [2024-11-20 02:18:17,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:17,880 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:17,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 193 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-20 02:18:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 855. [2024-11-20 02:18:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 755 states have (on average 1.262251655629139) internal successors, (953), 758 states have internal predecessors, (953), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 02:18:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1129 transitions. [2024-11-20 02:18:17,973 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1129 transitions. Word has length 119 [2024-11-20 02:18:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1129 transitions. [2024-11-20 02:18:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1129 transitions. [2024-11-20 02:18:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:17,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:17,975 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:17,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 02:18:17,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1981805366, now seen corresponding path program 1 times [2024-11-20 02:18:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959838647] [2024-11-20 02:18:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959838647] [2024-11-20 02:18:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959838647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149168576] [2024-11-20 02:18:18,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:18,047 INFO L87 Difference]: Start difference. First operand 855 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:18,214 INFO L93 Difference]: Finished difference Result 1901 states and 2515 transitions. [2024-11-20 02:18:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:18,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:18,219 INFO L225 Difference]: With dead ends: 1901 [2024-11-20 02:18:18,219 INFO L226 Difference]: Without dead ends: 1089 [2024-11-20 02:18:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:18,220 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 234 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-20 02:18:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 813. [2024-11-20 02:18:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 713 states have (on average 1.2524544179523143) internal successors, (893), 716 states have internal predecessors, (893), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 02:18:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1069 transitions. [2024-11-20 02:18:18,314 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1069 transitions. Word has length 119 [2024-11-20 02:18:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:18,314 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1069 transitions. [2024-11-20 02:18:18,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1069 transitions. [2024-11-20 02:18:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:18:18,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:18,317 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:18,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 02:18:18,317 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1440707967, now seen corresponding path program 1 times [2024-11-20 02:18:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556819472] [2024-11-20 02:18:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:18:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:18:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:18:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:18:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:18:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:18:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:18:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 02:18:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:18:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:18:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 02:18:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 02:18:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:18:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:18:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:18:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:18:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556819472] [2024-11-20 02:18:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556819472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:18,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097895463] [2024-11-20 02:18:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:18,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:18:18,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:18,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:18,397 INFO L87 Difference]: Start difference. First operand 813 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:18,627 INFO L93 Difference]: Finished difference Result 1811 states and 2383 transitions. [2024-11-20 02:18:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-20 02:18:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:18,634 INFO L225 Difference]: With dead ends: 1811 [2024-11-20 02:18:18,635 INFO L226 Difference]: Without dead ends: 1041 [2024-11-20 02:18:18,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-20 02:18:18,638 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:18,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 171 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-20 02:18:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 809. [2024-11-20 02:18:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 709 states have (on average 1.228490832157969) internal successors, (871), 712 states have internal predecessors, (871), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 02:18:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1047 transitions. [2024-11-20 02:18:18,741 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1047 transitions. Word has length 119 [2024-11-20 02:18:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:18,741 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1047 transitions. [2024-11-20 02:18:18,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1047 transitions. [2024-11-20 02:18:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-20 02:18:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:18,742 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 02:18:18,742 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1530613012, now seen corresponding path program 1 times [2024-11-20 02:18:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:18:18,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884150483] [2024-11-20 02:18:18,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:18:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:18:18,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:18:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:18:18,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:18:18,853 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:18:18,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:18:18,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 02:18:18,860 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-20 02:18:18,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:18:18,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:18:18 BoogieIcfgContainer [2024-11-20 02:18:18,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:18:18,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:18:18,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:18:18,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:18:18,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:18:04" (3/4) ... [2024-11-20 02:18:18,939 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:18:18,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:18:18,940 INFO L158 Benchmark]: Toolchain (without parser) took 15610.39ms. Allocated memory was 142.6MB in the beginning and 597.7MB in the end (delta: 455.1MB). Free memory was 72.8MB in the beginning and 341.8MB in the end (delta: -268.9MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,940 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 142.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:18:18,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.89ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 56.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.39ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 112.6MB in the end (delta: -56.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,941 INFO L158 Benchmark]: Boogie Preprocessor took 74.05ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 112.6MB in the beginning and 164.5MB in the end (delta: -51.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,941 INFO L158 Benchmark]: RCFGBuilder took 489.14ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 141.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,941 INFO L158 Benchmark]: TraceAbstraction took 14664.92ms. Allocated memory was 197.1MB in the beginning and 597.7MB in the end (delta: 400.6MB). Free memory was 140.4MB in the beginning and 341.8MB in the end (delta: -201.3MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. [2024-11-20 02:18:18,941 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 597.7MB. Free memory is still 341.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:18:18,942 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.11ms. Allocated memory is still 142.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.89ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 56.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.39ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 112.6MB in the end (delta: -56.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.05ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 112.6MB in the beginning and 164.5MB in the end (delta: -51.9MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * RCFGBuilder took 489.14ms. Allocated memory is still 197.1MB. Free memory was 164.5MB in the beginning and 141.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14664.92ms. Allocated memory was 197.1MB in the beginning and 597.7MB in the end (delta: 400.6MB). Free memory was 140.4MB in the beginning and 341.8MB in the end (delta: -201.3MB). Peak memory consumption was 199.2MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 597.7MB. Free memory is still 341.8MB. 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 121, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L90] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L90] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_18 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] var_1_19 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] var_1_20 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] var_1_21 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] var_1_22 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] var_1_23 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] var_1_27 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_28 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L48] COND FALSE !(last_1_var_1_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L51] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L52] COND FALSE !(\read(var_1_7)) [L55] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L57] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L60] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] COND TRUE (var_1_32 >> var_1_32) < var_1_13 [L62] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L64] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L65] COND TRUE var_1_11 >= var_1_30 [L66] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L68] COND TRUE ! var_1_7 [L69] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L78] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121-L122] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=0, var_1_22=505, var_1_24=-64, var_1_26=0, var_1_27=63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2751 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2751 mSDsluCounter, 10554 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7571 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4184 IncrementalHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 2983 mSDtfsCounter, 4184 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=855occurred in iteration=18, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 4750 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2477 NumberOfCodeBlocks, 2477 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2337 ConstructedInterpolants, 0 QuantifiedInterpolants, 5941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9600/9600 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-20 02:18:18,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:18:20,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:18:20,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:18:20,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:18:20,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:18:20,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:18:20,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:18:20,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:18:20,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:18:20,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:18:20,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:18:20,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:18:20,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:18:20,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:18:20,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:18:20,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:18:20,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:18:20,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:18:20,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:18:20,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:18:20,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:18:20,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:18:20,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:18:20,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:18:20,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:18:21,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:18:21,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:18:21,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:18:21,000 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:18:21,000 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:18:21,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:18:21,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:18:21,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:18:21,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:18:21,001 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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-11-20 02:18:21,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:18:21,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:18:21,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:18:21,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:18:21,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:18:21,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:22,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:18:22,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:18:22,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:22,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee5976de/b1c3b82f64ed45a1a91cc23b814cac8d/FLAG5ee692767 [2024-11-20 02:18:22,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee5976de/b1c3b82f64ed45a1a91cc23b814cac8d [2024-11-20 02:18:22,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:18:22,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:18:22,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:18:22,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:18:22,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:18:22,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:18:22" (1/1) ... [2024-11-20 02:18:22,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:22, skipping insertion in model container [2024-11-20 02:18:22,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:18:22" (1/1) ... [2024-11-20 02:18:22,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:18:23,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-20 02:18:23,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:18:23,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:18:23,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i[919,932] [2024-11-20 02:18:23,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:18:23,292 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:18:23,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23 WrapperNode [2024-11-20 02:18:23,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:18:23,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:18:23,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:18:23,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:18:23,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,349 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-20 02:18:23,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:18:23,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:18:23,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:18:23,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:18:23,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,389 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-20 02:18:23,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:18:23,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:18:23,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:18:23,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:18:23,420 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (1/1) ... [2024-11-20 02:18:23,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:18:23,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:18:23,450 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-20 02:18:23,453 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-20 02:18:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:18:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:18:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:18:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:18:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:18:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:18:23,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:18:23,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:18:30,161 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:18:30,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:18:30,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:18:30,179 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:18:30,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:18:30 BoogieIcfgContainer [2024-11-20 02:18:30,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:18:30,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:18:30,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:18:30,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:18:30,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:18:22" (1/3) ... [2024-11-20 02:18:30,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d42122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:18:30, skipping insertion in model container [2024-11-20 02:18:30,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:18:23" (2/3) ... [2024-11-20 02:18:30,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d42122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:18:30, skipping insertion in model container [2024-11-20 02:18:30,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:18:30" (3/3) ... [2024-11-20 02:18:30,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-11-20 02:18:30,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:18:30,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:18:30,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:18:30,280 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;@1f686440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:18:30,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:18:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 02:18:30,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:30,301 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:30,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1221950911, now seen corresponding path program 1 times [2024-11-20 02:18:30,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:18:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238289612] [2024-11-20 02:18:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:30,319 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-20 02:18:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:18:30,322 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-20 02:18:30,323 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-20 02:18:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:30,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:18:30,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:18:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-20 02:18:30,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:18:30,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:18:30,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238289612] [2024-11-20 02:18:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238289612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:30,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:30,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:18:30,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011242824] [2024-11-20 02:18:30,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:18:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:18:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:18:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:18:30,744 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 02:18:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:30,763 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2024-11-20 02:18:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:18:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-20 02:18:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:30,770 INFO L225 Difference]: With dead ends: 109 [2024-11-20 02:18:30,770 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 02:18:30,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-20 02:18:30,775 INFO L432 NwaCegarLoop]: 78 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, 78 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-20 02:18:30,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:18:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 02:18:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 02:18:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-20 02:18:30,821 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 110 [2024-11-20 02:18:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:30,822 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-20 02:18:30,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 02:18:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-20 02:18:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 02:18:30,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:30,827 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:30,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:18:31,028 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-20 02:18:31,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1847373171, now seen corresponding path program 1 times [2024-11-20 02:18:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:18:31,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24551791] [2024-11-20 02:18:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:31,030 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-20 02:18:31,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:18:31,033 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-20 02:18:31,034 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-20 02:18:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:31,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:18:31,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:18:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 02:18:31,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:18:31,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:18:31,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24551791] [2024-11-20 02:18:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24551791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:18:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:18:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:18:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417590681] [2024-11-20 02:18:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:18:31,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:18:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:18:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:18:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:18:31,459 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:35,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:18:39,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:18:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:18:39,091 INFO L93 Difference]: Finished difference Result 121 states and 175 transitions. [2024-11-20 02:18:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:18:39,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-20 02:18:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:18:39,094 INFO L225 Difference]: With dead ends: 121 [2024-11-20 02:18:39,095 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 02:18:39,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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-20 02:18:39,096 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:18:39,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-20 02:18:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 02:18:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2024-11-20 02:18:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 02:18:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-20 02:18:39,105 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 110 [2024-11-20 02:18:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:18:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-20 02:18:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 02:18:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-20 02:18:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-20 02:18:39,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:18:39,108 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:39,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:18:39,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:18:39,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:18:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:18:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1488364109, now seen corresponding path program 1 times [2024-11-20 02:18:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:18:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474152516] [2024-11-20 02:18:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:18:39,310 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-20 02:18:39,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:18:39,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:18:39,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 02:18:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:18:39,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 02:18:39,622 INFO L278 TraceCheckSpWp]: Computing forward predicates...