./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:32:13,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:32:13,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:32:13,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:32:13,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:32:13,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:32:13,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:32:13,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:32:13,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:32:13,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:32:13,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:32:13,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:32:13,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:32:13,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:32:13,642 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:32:13,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:32:13,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:32:13,643 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:32:13,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:32:13,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:32:13,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:32:13,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:32:13,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:32:13,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:32:13,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:32:13,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:32:13,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:32:13,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:32:13,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:32:13,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:32:13,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:32:13,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:32:13,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:32:13,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:32:13,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:32:13,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:32:13,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:32:13,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:32:13,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:32:13,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:32:13,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:32:13,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:32:13,653 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2024-11-08 15:32:13,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:32:13,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:32:13,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:32:13,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:32:13,859 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:32:13,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:15,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:32:15,376 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:32:15,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:15,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a73bce72/193a0ccd551f4cddb18dfb1aa4c83532/FLAGf78ff367c [2024-11-08 15:32:15,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a73bce72/193a0ccd551f4cddb18dfb1aa4c83532 [2024-11-08 15:32:15,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:32:15,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:32:15,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:32:15,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:32:15,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:32:15,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2156de70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15, skipping insertion in model container [2024-11-08 15:32:15,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:32:15,625 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-08 15:32:15,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:32:15,642 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:32:15,778 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-11-08 15:32:15,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:32:15,832 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:32:15,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15 WrapperNode [2024-11-08 15:32:15,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:32:15,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:32:15,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:32:15,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:32:15,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,938 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-11-08 15:32:15,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:32:15,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:32:15,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:32:15,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:32:15,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,994 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:32:15,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:15,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:32:16,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:32:16,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:32:16,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:32:16,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (1/1) ... [2024-11-08 15:32:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:32:16,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:16,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:32:16,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:32:16,115 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-08 15:32:16,115 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-08 15:32:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:32:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-08 15:32:16,116 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-08 15:32:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-08 15:32:16,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-08 15:32:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-08 15:32:16,116 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-08 15:32:16,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 15:32:16,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 15:32:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:32:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-08 15:32:16,117 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-08 15:32:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:32:16,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:32:16,117 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-08 15:32:16,117 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-08 15:32:16,199 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:32:16,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:32:16,596 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-08 15:32:16,596 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:32:16,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:32:16,609 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:32:16,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:32:16 BoogieIcfgContainer [2024-11-08 15:32:16,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:32:16,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:32:16,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:32:16,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:32:16,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:32:15" (1/3) ... [2024-11-08 15:32:16,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d8760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:32:16, skipping insertion in model container [2024-11-08 15:32:16,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:15" (2/3) ... [2024-11-08 15:32:16,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596d8760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:32:16, skipping insertion in model container [2024-11-08 15:32:16,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:32:16" (3/3) ... [2024-11-08 15:32:16,615 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:16,628 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:32:16,628 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:32:16,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:32:16,682 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;@b8b15fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:32:16,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:32:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 15:32:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:32:16,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:16,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:16,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:16,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1699901086, now seen corresponding path program 1 times [2024-11-08 15:32:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:16,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607710004] [2024-11-08 15:32:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:16,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:16,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607710004] [2024-11-08 15:32:16,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607710004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:16,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:16,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:32:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585637229] [2024-11-08 15:32:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:32:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:32:16,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:32:16,930 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:16,990 INFO L93 Difference]: Finished difference Result 340 states and 557 transitions. [2024-11-08 15:32:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:32:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-08 15:32:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:17,051 INFO L225 Difference]: With dead ends: 340 [2024-11-08 15:32:17,051 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 15:32:17,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:32:17,060 INFO L432 NwaCegarLoop]: 273 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, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:17,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 15:32:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-08 15:32:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 15:32:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions. [2024-11-08 15:32:17,136 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28 [2024-11-08 15:32:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions. [2024-11-08 15:32:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions. [2024-11-08 15:32:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:32:17,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:17,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:17,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:32:17,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:17,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1918755804, now seen corresponding path program 1 times [2024-11-08 15:32:17,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:17,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131189921] [2024-11-08 15:32:17,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:17,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131189921] [2024-11-08 15:32:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131189921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:32:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110954615] [2024-11-08 15:32:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:32:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:32:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:17,445 INFO L87 Difference]: Start difference. First operand 176 states and 273 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:17,534 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions. [2024-11-08 15:32:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:32:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-08 15:32:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:17,537 INFO L225 Difference]: With dead ends: 338 [2024-11-08 15:32:17,539 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 15:32:17,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:17,541 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:17,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 15:32:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-08 15:32:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 15:32:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2024-11-08 15:32:17,568 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28 [2024-11-08 15:32:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:17,569 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2024-11-08 15:32:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2024-11-08 15:32:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:32:17,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:17,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:17,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:32:17,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1355709569, now seen corresponding path program 1 times [2024-11-08 15:32:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:17,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693858381] [2024-11-08 15:32:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:17,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:17,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693858381] [2024-11-08 15:32:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693858381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766547009] [2024-11-08 15:32:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:17,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:17,866 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:17,921 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions. [2024-11-08 15:32:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:17,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-08 15:32:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:17,925 INFO L225 Difference]: With dead ends: 339 [2024-11-08 15:32:17,925 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 15:32:17,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:17,927 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 15:32:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-08 15:32:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 15:32:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions. [2024-11-08 15:32:17,943 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39 [2024-11-08 15:32:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:17,944 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions. [2024-11-08 15:32:17,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions. [2024-11-08 15:32:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 15:32:17,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:17,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:17,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:32:17,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:17,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2086587661, now seen corresponding path program 1 times [2024-11-08 15:32:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:17,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615163374] [2024-11-08 15:32:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 15:32:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:18,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:18,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615163374] [2024-11-08 15:32:18,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615163374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:18,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:18,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:32:18,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517419997] [2024-11-08 15:32:18,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:18,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:32:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:32:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:18,055 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:18,097 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2024-11-08 15:32:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:32:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2024-11-08 15:32:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:18,099 INFO L225 Difference]: With dead ends: 494 [2024-11-08 15:32:18,099 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 15:32:18,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:18,103 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:18,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 523 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 15:32:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2024-11-08 15:32:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 15:32:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-08 15:32:18,140 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55 [2024-11-08 15:32:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:18,141 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-08 15:32:18,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-08 15:32:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 15:32:18,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:18,144 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:18,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:32:18,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:18,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 651939805, now seen corresponding path program 1 times [2024-11-08 15:32:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297865741] [2024-11-08 15:32:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 15:32:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:18,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:18,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297865741] [2024-11-08 15:32:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297865741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:18,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:32:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979784128] [2024-11-08 15:32:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:32:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:32:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:18,249 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:18,292 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions. [2024-11-08 15:32:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:32:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2024-11-08 15:32:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:18,299 INFO L225 Difference]: With dead ends: 917 [2024-11-08 15:32:18,299 INFO L226 Difference]: Without dead ends: 608 [2024-11-08 15:32:18,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:18,302 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:18,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 545 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-08 15:32:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2024-11-08 15:32:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 15:32:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2024-11-08 15:32:18,347 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56 [2024-11-08 15:32:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:18,348 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2024-11-08 15:32:18,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2024-11-08 15:32:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 15:32:18,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:18,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:32:18,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:18,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash -627923873, now seen corresponding path program 1 times [2024-11-08 15:32:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308730485] [2024-11-08 15:32:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 15:32:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308730485] [2024-11-08 15:32:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308730485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336625679] [2024-11-08 15:32:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:18,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:18,537 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:18,721 INFO L93 Difference]: Finished difference Result 1291 states and 1928 transitions. [2024-11-08 15:32:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2024-11-08 15:32:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:18,727 INFO L225 Difference]: With dead ends: 1291 [2024-11-08 15:32:18,729 INFO L226 Difference]: Without dead ends: 706 [2024-11-08 15:32:18,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-08 15:32:18,731 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:18,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-08 15:32:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 690. [2024-11-08 15:32:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions. [2024-11-08 15:32:18,812 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56 [2024-11-08 15:32:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:18,815 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions. [2024-11-08 15:32:18,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions. [2024-11-08 15:32:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 15:32:18,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:18,816 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:32:18,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:18,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash 707313810, now seen corresponding path program 1 times [2024-11-08 15:32:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:18,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97128397] [2024-11-08 15:32:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97128397] [2024-11-08 15:32:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97128397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524991883] [2024-11-08 15:32:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:18,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:18,958 INFO L87 Difference]: Start difference. First operand 690 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:19,120 INFO L93 Difference]: Finished difference Result 1295 states and 1928 transitions. [2024-11-08 15:32:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:19,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2024-11-08 15:32:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:19,124 INFO L225 Difference]: With dead ends: 1295 [2024-11-08 15:32:19,124 INFO L226 Difference]: Without dead ends: 710 [2024-11-08 15:32:19,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-08 15:32:19,126 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:19,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-08 15:32:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698. [2024-11-08 15:32:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions. [2024-11-08 15:32:19,161 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57 [2024-11-08 15:32:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:19,162 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions. [2024-11-08 15:32:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions. [2024-11-08 15:32:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-08 15:32:19,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:19,164 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:19,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:32:19,165 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:19,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1187610108, now seen corresponding path program 1 times [2024-11-08 15:32:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:19,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266601668] [2024-11-08 15:32:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 15:32:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:19,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266601668] [2024-11-08 15:32:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266601668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161269165] [2024-11-08 15:32:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:19,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:19,280 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:19,413 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions. [2024-11-08 15:32:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2024-11-08 15:32:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:19,417 INFO L225 Difference]: With dead ends: 1283 [2024-11-08 15:32:19,417 INFO L226 Difference]: Without dead ends: 698 [2024-11-08 15:32:19,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:19,419 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 61 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:19,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-08 15:32:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-08 15:32:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions. [2024-11-08 15:32:19,452 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59 [2024-11-08 15:32:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions. [2024-11-08 15:32:19,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions. [2024-11-08 15:32:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:32:19,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:19,453 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:19,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:32:19,454 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1980797779, now seen corresponding path program 1 times [2024-11-08 15:32:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067584727] [2024-11-08 15:32:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:19,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067584727] [2024-11-08 15:32:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067584727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211015065] [2024-11-08 15:32:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:19,605 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:32:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:19,647 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions. [2024-11-08 15:32:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-08 15:32:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:19,651 INFO L225 Difference]: With dead ends: 1303 [2024-11-08 15:32:19,651 INFO L226 Difference]: Without dead ends: 718 [2024-11-08 15:32:19,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:19,655 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:19,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-08 15:32:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-11-08 15:32:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions. [2024-11-08 15:32:19,689 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60 [2024-11-08 15:32:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:19,690 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions. [2024-11-08 15:32:19,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:32:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions. [2024-11-08 15:32:19,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 15:32:19,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:19,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:19,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:32:19,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:19,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1474712019, now seen corresponding path program 1 times [2024-11-08 15:32:19,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222852878] [2024-11-08 15:32:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222852878] [2024-11-08 15:32:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222852878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:19,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:19,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237247977] [2024-11-08 15:32:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:19,824 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:19,891 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions. [2024-11-08 15:32:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2024-11-08 15:32:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:19,897 INFO L225 Difference]: With dead ends: 1343 [2024-11-08 15:32:19,897 INFO L226 Difference]: Without dead ends: 738 [2024-11-08 15:32:19,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:19,899 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:19,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-08 15:32:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-08 15:32:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions. [2024-11-08 15:32:19,968 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68 [2024-11-08 15:32:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:19,968 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions. [2024-11-08 15:32:19,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions. [2024-11-08 15:32:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:32:19,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:19,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:19,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:32:19,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash -799213667, now seen corresponding path program 1 times [2024-11-08 15:32:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072922593] [2024-11-08 15:32:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072922593] [2024-11-08 15:32:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072922593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:20,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977703557] [2024-11-08 15:32:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:20,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:20,077 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:32:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:20,125 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions. [2024-11-08 15:32:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2024-11-08 15:32:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:20,129 INFO L225 Difference]: With dead ends: 1379 [2024-11-08 15:32:20,129 INFO L226 Difference]: Without dead ends: 754 [2024-11-08 15:32:20,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:20,131 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 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-08 15:32:20,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-08 15:32:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-11-08 15:32:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions. [2024-11-08 15:32:20,160 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76 [2024-11-08 15:32:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:20,160 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions. [2024-11-08 15:32:20,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:32:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions. [2024-11-08 15:32:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:32:20,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:20,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:20,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:32:20,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:20,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1597245636, now seen corresponding path program 1 times [2024-11-08 15:32:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304011895] [2024-11-08 15:32:20,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:32:20,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304011895] [2024-11-08 15:32:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304011895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054144852] [2024-11-08 15:32:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:20,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:20,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:20,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:20,320 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:32:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:20,387 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions. [2024-11-08 15:32:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2024-11-08 15:32:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:20,391 INFO L225 Difference]: With dead ends: 1415 [2024-11-08 15:32:20,391 INFO L226 Difference]: Without dead ends: 774 [2024-11-08 15:32:20,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:20,393 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:20,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-08 15:32:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2024-11-08 15:32:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions. [2024-11-08 15:32:20,433 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76 [2024-11-08 15:32:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:20,433 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions. [2024-11-08 15:32:20,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 15:32:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions. [2024-11-08 15:32:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 15:32:20,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:20,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:32:20,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:20,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash 837268772, now seen corresponding path program 1 times [2024-11-08 15:32:20,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420249026] [2024-11-08 15:32:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 15:32:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420249026] [2024-11-08 15:32:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420249026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515035302] [2024-11-08 15:32:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:20,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:20,576 INFO L87 Difference]: Start difference. First operand 774 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:20,627 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions. [2024-11-08 15:32:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2024-11-08 15:32:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:20,631 INFO L225 Difference]: With dead ends: 1459 [2024-11-08 15:32:20,631 INFO L226 Difference]: Without dead ends: 798 [2024-11-08 15:32:20,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:20,633 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:20,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2024-11-08 15:32:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2024-11-08 15:32:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 15:32:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2024-11-08 15:32:20,690 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84 [2024-11-08 15:32:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:20,690 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2024-11-08 15:32:20,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2024-11-08 15:32:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 15:32:20,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:20,693 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:32:20,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1610117125, now seen corresponding path program 1 times [2024-11-08 15:32:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567419814] [2024-11-08 15:32:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:32:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567419814] [2024-11-08 15:32:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567419814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10846886] [2024-11-08 15:32:21,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:21,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:21,225 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 15:32:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:21,466 INFO L93 Difference]: Finished difference Result 2053 states and 2823 transitions. [2024-11-08 15:32:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:32:21,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-11-08 15:32:21,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:21,474 INFO L225 Difference]: With dead ends: 2053 [2024-11-08 15:32:21,474 INFO L226 Difference]: Without dead ends: 1368 [2024-11-08 15:32:21,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:21,477 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 196 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:21,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1476 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:21,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-08 15:32:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1082. [2024-11-08 15:32:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-08 15:32:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions. [2024-11-08 15:32:21,564 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87 [2024-11-08 15:32:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions. [2024-11-08 15:32:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 15:32:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions. [2024-11-08 15:32:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-08 15:32:21,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:21,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:21,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:32:21,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1820782171, now seen corresponding path program 1 times [2024-11-08 15:32:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154709763] [2024-11-08 15:32:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:32:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:32:21,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:21,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154709763] [2024-11-08 15:32:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154709763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830469289] [2024-11-08 15:32:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:21,708 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 15:32:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:21,785 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions. [2024-11-08 15:32:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2024-11-08 15:32:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:21,833 INFO L225 Difference]: With dead ends: 2007 [2024-11-08 15:32:21,833 INFO L226 Difference]: Without dead ends: 1106 [2024-11-08 15:32:21,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:21,837 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 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-08 15:32:21,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2024-11-08 15:32:21,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2024-11-08 15:32:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-08 15:32:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions. [2024-11-08 15:32:21,897 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91 [2024-11-08 15:32:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:21,898 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions. [2024-11-08 15:32:21,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 15:32:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions. [2024-11-08 15:32:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 15:32:21,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:21,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:32:21,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:21,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1723609181, now seen corresponding path program 1 times [2024-11-08 15:32:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:21,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060842226] [2024-11-08 15:32:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:32:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060842226] [2024-11-08 15:32:22,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060842226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:22,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:22,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:32:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36029816] [2024-11-08 15:32:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:22,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:32:22,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:22,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:32:22,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:32:22,184 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 15:32:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:22,371 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions. [2024-11-08 15:32:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:32:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2024-11-08 15:32:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:22,377 INFO L225 Difference]: With dead ends: 1536 [2024-11-08 15:32:22,377 INFO L226 Difference]: Without dead ends: 1534 [2024-11-08 15:32:22,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:32:22,378 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 271 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:22,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2605 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-08 15:32:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114. [2024-11-08 15:32:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3627797408716136) internal successors, (1157), 856 states have internal predecessors, (1157), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-08 15:32:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1505 transitions. [2024-11-08 15:32:22,465 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1505 transitions. Word has length 90 [2024-11-08 15:32:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:22,465 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1505 transitions. [2024-11-08 15:32:22,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 15:32:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1505 transitions. [2024-11-08 15:32:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 15:32:22,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:22,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:22,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:32:22,468 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:22,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2094931668, now seen corresponding path program 1 times [2024-11-08 15:32:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:22,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071220839] [2024-11-08 15:32:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:32:22,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:22,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071220839] [2024-11-08 15:32:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071220839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:22,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383431323] [2024-11-08 15:32:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:22,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:22,631 INFO L87 Difference]: Start difference. First operand 1114 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 15:32:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:22,806 INFO L93 Difference]: Finished difference Result 2010 states and 2726 transitions. [2024-11-08 15:32:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:32:22,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2024-11-08 15:32:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:22,812 INFO L225 Difference]: With dead ends: 2010 [2024-11-08 15:32:22,812 INFO L226 Difference]: Without dead ends: 1159 [2024-11-08 15:32:22,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:22,814 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 255 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:22,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1485 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-08 15:32:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1117. [2024-11-08 15:32:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3534183082271147) internal successors, (1168), 875 states have internal predecessors, (1168), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-08 15:32:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1492 transitions. [2024-11-08 15:32:22,868 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1492 transitions. Word has length 93 [2024-11-08 15:32:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:22,868 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1492 transitions. [2024-11-08 15:32:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 15:32:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1492 transitions. [2024-11-08 15:32:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 15:32:22,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:22,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:22,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:32:22,870 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:22,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1811425973, now seen corresponding path program 1 times [2024-11-08 15:32:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:22,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289112381] [2024-11-08 15:32:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:32:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 15:32:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289112381] [2024-11-08 15:32:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289112381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116247540] [2024-11-08 15:32:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:23,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:23,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:23,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:23,283 INFO L87 Difference]: Start difference. First operand 1117 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:32:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:23,529 INFO L93 Difference]: Finished difference Result 1989 states and 2669 transitions. [2024-11-08 15:32:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:32:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2024-11-08 15:32:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:23,534 INFO L225 Difference]: With dead ends: 1989 [2024-11-08 15:32:23,534 INFO L226 Difference]: Without dead ends: 1115 [2024-11-08 15:32:23,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:23,536 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 150 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:23,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1601 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-11-08 15:32:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1008. [2024-11-08 15:32:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3559539052496798) internal successors, (1059), 791 states have internal predecessors, (1059), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-08 15:32:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1349 transitions. [2024-11-08 15:32:23,581 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1349 transitions. Word has length 95 [2024-11-08 15:32:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:23,581 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1349 transitions. [2024-11-08 15:32:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:32:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1349 transitions. [2024-11-08 15:32:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 15:32:23,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:23,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:32:23,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash -375753860, now seen corresponding path program 1 times [2024-11-08 15:32:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515570236] [2024-11-08 15:32:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:32:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:32:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:32:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515570236] [2024-11-08 15:32:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515570236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:24,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377882423] [2024-11-08 15:32:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:24,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:24,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:24,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:24,076 INFO L87 Difference]: Start difference. First operand 1008 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:32:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:24,433 INFO L93 Difference]: Finished difference Result 1920 states and 2556 transitions. [2024-11-08 15:32:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:32:24,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-08 15:32:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:24,438 INFO L225 Difference]: With dead ends: 1920 [2024-11-08 15:32:24,438 INFO L226 Difference]: Without dead ends: 1075 [2024-11-08 15:32:24,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:24,440 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 409 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:24,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1262 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:32:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-08 15:32:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1024. [2024-11-08 15:32:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 789 states have (on average 1.3333333333333333) internal successors, (1052), 800 states have internal predecessors, (1052), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 15:32:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1348 transitions. [2024-11-08 15:32:24,497 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1348 transitions. Word has length 96 [2024-11-08 15:32:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:24,497 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1348 transitions. [2024-11-08 15:32:24,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 15:32:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1348 transitions. [2024-11-08 15:32:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 15:32:24,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:24,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:32:24,498 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -566843121, now seen corresponding path program 1 times [2024-11-08 15:32:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142228263] [2024-11-08 15:32:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:32:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:32:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:32:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:32:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142228263] [2024-11-08 15:32:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142228263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:24,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:24,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:24,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071577923] [2024-11-08 15:32:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:24,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:24,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:24,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:24,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:24,591 INFO L87 Difference]: Start difference. First operand 1024 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:24,736 INFO L93 Difference]: Finished difference Result 2693 states and 3570 transitions. [2024-11-08 15:32:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-11-08 15:32:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:24,744 INFO L225 Difference]: With dead ends: 2693 [2024-11-08 15:32:24,744 INFO L226 Difference]: Without dead ends: 1883 [2024-11-08 15:32:24,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:24,746 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 201 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:24,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-11-08 15:32:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1768. [2024-11-08 15:32:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1343 states have (on average 1.326880119136262) internal successors, (1782), 1362 states have internal predecessors, (1782), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-11-08 15:32:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2326 transitions. [2024-11-08 15:32:24,846 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2326 transitions. Word has length 97 [2024-11-08 15:32:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:24,847 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2326 transitions. [2024-11-08 15:32:24,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2326 transitions. [2024-11-08 15:32:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:32:24,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:24,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:32:24,848 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1375100484, now seen corresponding path program 1 times [2024-11-08 15:32:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567748077] [2024-11-08 15:32:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:32:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:32:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:32:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:32:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:32:25,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567748077] [2024-11-08 15:32:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567748077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465516171] [2024-11-08 15:32:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:25,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:25,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:25,359 INFO L87 Difference]: Start difference. First operand 1768 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:25,806 INFO L93 Difference]: Finished difference Result 3436 states and 4520 transitions. [2024-11-08 15:32:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:32:25,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-11-08 15:32:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:25,814 INFO L225 Difference]: With dead ends: 3436 [2024-11-08 15:32:25,814 INFO L226 Difference]: Without dead ends: 1964 [2024-11-08 15:32:25,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:25,817 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 419 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:25,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1472 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:32:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-08 15:32:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1793. [2024-11-08 15:32:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3210332103321034) internal successors, (1790), 1375 states have internal predecessors, (1790), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-08 15:32:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2350 transitions. [2024-11-08 15:32:26,045 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2350 transitions. Word has length 99 [2024-11-08 15:32:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:26,046 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2350 transitions. [2024-11-08 15:32:26,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2350 transitions. [2024-11-08 15:32:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 15:32:26,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:26,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:26,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:32:26,048 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -599061911, now seen corresponding path program 1 times [2024-11-08 15:32:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339712220] [2024-11-08 15:32:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 15:32:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:32:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:32:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:32:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:32:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339712220] [2024-11-08 15:32:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339712220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:26,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:26,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058180624] [2024-11-08 15:32:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:26,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:26,172 INFO L87 Difference]: Start difference. First operand 1793 states and 2350 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:26,404 INFO L93 Difference]: Finished difference Result 4547 states and 5996 transitions. [2024-11-08 15:32:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2024-11-08 15:32:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:26,421 INFO L225 Difference]: With dead ends: 4547 [2024-11-08 15:32:26,421 INFO L226 Difference]: Without dead ends: 3091 [2024-11-08 15:32:26,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:26,429 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 207 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:26,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1189 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3091 states. [2024-11-08 15:32:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3091 to 2814. [2024-11-08 15:32:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2101 states have (on average 1.3122322703474536) internal successors, (2757), 2132 states have internal predecessors, (2757), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-11-08 15:32:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 3677 transitions. [2024-11-08 15:32:26,696 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 3677 transitions. Word has length 101 [2024-11-08 15:32:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 2814 states and 3677 transitions. [2024-11-08 15:32:26,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3677 transitions. [2024-11-08 15:32:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 15:32:26,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:26,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:32:26,698 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 647926777, now seen corresponding path program 1 times [2024-11-08 15:32:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320307975] [2024-11-08 15:32:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:32:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 15:32:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:32:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:32:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:32:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:32:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:26,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:26,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320307975] [2024-11-08 15:32:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320307975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589512388] [2024-11-08 15:32:26,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:26,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:26,784 INFO L87 Difference]: Start difference. First operand 2814 states and 3677 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:27,124 INFO L93 Difference]: Finished difference Result 6570 states and 8628 transitions. [2024-11-08 15:32:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2024-11-08 15:32:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:27,146 INFO L225 Difference]: With dead ends: 6570 [2024-11-08 15:32:27,149 INFO L226 Difference]: Without dead ends: 4213 [2024-11-08 15:32:27,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:27,154 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 200 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:27,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1201 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2024-11-08 15:32:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 4030. [2024-11-08 15:32:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4030 states, 2993 states have (on average 1.3087203474774474) internal successors, (3917), 3037 states have internal predecessors, (3917), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-08 15:32:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4030 states to 4030 states and 5261 transitions. [2024-11-08 15:32:27,433 INFO L78 Accepts]: Start accepts. Automaton has 4030 states and 5261 transitions. Word has length 101 [2024-11-08 15:32:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:27,433 INFO L471 AbstractCegarLoop]: Abstraction has 4030 states and 5261 transitions. [2024-11-08 15:32:27,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4030 states and 5261 transitions. [2024-11-08 15:32:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 15:32:27,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:27,435 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 15:32:27,435 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1760044486, now seen corresponding path program 1 times [2024-11-08 15:32:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579890884] [2024-11-08 15:32:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:32:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:32:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:32:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:32:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:32:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:32:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579890884] [2024-11-08 15:32:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579890884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:27,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:32:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226676496] [2024-11-08 15:32:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:27,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:32:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:27,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:32:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:27,492 INFO L87 Difference]: Start difference. First operand 4030 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:27,949 INFO L93 Difference]: Finished difference Result 7739 states and 10153 transitions. [2024-11-08 15:32:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:32:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2024-11-08 15:32:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:27,973 INFO L225 Difference]: With dead ends: 7739 [2024-11-08 15:32:27,973 INFO L226 Difference]: Without dead ends: 4063 [2024-11-08 15:32:27,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:27,983 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 6 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:27,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 487 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2024-11-08 15:32:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4036. [2024-11-08 15:32:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2999 states have (on average 1.3081027009003001) internal successors, (3923), 3043 states have internal predecessors, (3923), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-08 15:32:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5267 transitions. [2024-11-08 15:32:28,459 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5267 transitions. Word has length 102 [2024-11-08 15:32:28,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 4036 states and 5267 transitions. [2024-11-08 15:32:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5267 transitions. [2024-11-08 15:32:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 15:32:28,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:28,461 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:28,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 15:32:28,462 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:28,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1930890164, now seen corresponding path program 1 times [2024-11-08 15:32:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789606600] [2024-11-08 15:32:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:32:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 15:32:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:32:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:32:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:32:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:32:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:28,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789606600] [2024-11-08 15:32:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789606600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:28,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:28,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805475498] [2024-11-08 15:32:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:28,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:28,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:28,571 INFO L87 Difference]: Start difference. First operand 4036 states and 5267 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:28,861 INFO L93 Difference]: Finished difference Result 7704 states and 10080 transitions. [2024-11-08 15:32:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 103 [2024-11-08 15:32:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:28,880 INFO L225 Difference]: With dead ends: 7704 [2024-11-08 15:32:28,880 INFO L226 Difference]: Without dead ends: 3744 [2024-11-08 15:32:28,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:28,890 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 83 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:28,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 746 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2024-11-08 15:32:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3681. [2024-11-08 15:32:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2727 states have (on average 1.3182984965163183) internal successors, (3595), 2761 states have internal predecessors, (3595), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-08 15:32:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 4835 transitions. [2024-11-08 15:32:29,136 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 4835 transitions. Word has length 103 [2024-11-08 15:32:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:29,136 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 4835 transitions. [2024-11-08 15:32:29,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 4835 transitions. [2024-11-08 15:32:29,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 15:32:29,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:29,138 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:29,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 15:32:29,139 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1500264054, now seen corresponding path program 1 times [2024-11-08 15:32:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160481642] [2024-11-08 15:32:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:32:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:32:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:32:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:32:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:32:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:32:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:29,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160481642] [2024-11-08 15:32:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160481642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:32:29,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835833911] [2024-11-08 15:32:29,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:29,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:32:29,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:29,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:32:29,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:29,189 INFO L87 Difference]: Start difference. First operand 3681 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:29,487 INFO L93 Difference]: Finished difference Result 7191 states and 9479 transitions. [2024-11-08 15:32:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:32:29,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2024-11-08 15:32:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:29,499 INFO L225 Difference]: With dead ends: 7191 [2024-11-08 15:32:29,500 INFO L226 Difference]: Without dead ends: 3691 [2024-11-08 15:32:29,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:29,505 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:29,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2024-11-08 15:32:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2024-11-08 15:32:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 2737 states have (on average 1.3171355498721227) internal successors, (3605), 2771 states have internal predecessors, (3605), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-08 15:32:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4845 transitions. [2024-11-08 15:32:29,838 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4845 transitions. Word has length 104 [2024-11-08 15:32:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:29,838 INFO L471 AbstractCegarLoop]: Abstraction has 3691 states and 4845 transitions. [2024-11-08 15:32:29,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4845 transitions. [2024-11-08 15:32:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 15:32:29,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:29,840 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:29,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 15:32:29,841 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1445902481, now seen corresponding path program 1 times [2024-11-08 15:32:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554274749] [2024-11-08 15:32:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:29,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:32:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:32:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:32:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:32:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:32:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:32:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 15:32:29,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554274749] [2024-11-08 15:32:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554274749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:29,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:29,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:29,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119909845] [2024-11-08 15:32:29,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:29,953 INFO L87 Difference]: Start difference. First operand 3691 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:30,159 INFO L93 Difference]: Finished difference Result 7183 states and 9451 transitions. [2024-11-08 15:32:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2024-11-08 15:32:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:30,173 INFO L225 Difference]: With dead ends: 7183 [2024-11-08 15:32:30,173 INFO L226 Difference]: Without dead ends: 3611 [2024-11-08 15:32:30,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:30,179 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 64 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:30,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 756 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2024-11-08 15:32:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 2783. [2024-11-08 15:32:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2783 states, 2063 states have (on average 1.3116820164808531) internal successors, (2706), 2082 states have internal predecessors, (2706), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-11-08 15:32:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3644 transitions. [2024-11-08 15:32:30,395 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3644 transitions. Word has length 104 [2024-11-08 15:32:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:30,396 INFO L471 AbstractCegarLoop]: Abstraction has 2783 states and 3644 transitions. [2024-11-08 15:32:30,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3644 transitions. [2024-11-08 15:32:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 15:32:30,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:30,399 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:30,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 15:32:30,399 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash 486642331, now seen corresponding path program 1 times [2024-11-08 15:32:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702719819] [2024-11-08 15:32:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:32:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:32:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:32:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:32:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:32:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:32:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:32:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:32:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 15:32:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 15:32:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 15:32:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:32:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 15:32:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702719819] [2024-11-08 15:32:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702719819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918731837] [2024-11-08 15:32:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:30,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:30,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:32:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:30,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 15:32:30,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-08 15:32:31,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 15:32:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918731837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:31,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2024-11-08 15:32:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600649484] [2024-11-08 15:32:31,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:31,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 15:32:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 15:32:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:32:31,304 INFO L87 Difference]: Start difference. First operand 2783 states and 3644 transitions. Second operand has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-08 15:32:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:33,723 INFO L93 Difference]: Finished difference Result 7237 states and 9459 transitions. [2024-11-08 15:32:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-08 15:32:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 153 [2024-11-08 15:32:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:33,743 INFO L225 Difference]: With dead ends: 7237 [2024-11-08 15:32:33,743 INFO L226 Difference]: Without dead ends: 4647 [2024-11-08 15:32:33,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2024-11-08 15:32:33,751 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 1925 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:33,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 3799 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:32:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2024-11-08 15:32:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 4248. [2024-11-08 15:32:34,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 3125 states have (on average 1.30528) internal successors, (4079), 3153 states have internal predecessors, (4079), 730 states have call successors, (730), 392 states have call predecessors, (730), 392 states have return successors, (730), 702 states have call predecessors, (730), 730 states have call successors, (730) [2024-11-08 15:32:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5539 transitions. [2024-11-08 15:32:34,313 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5539 transitions. Word has length 153 [2024-11-08 15:32:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:34,314 INFO L471 AbstractCegarLoop]: Abstraction has 4248 states and 5539 transitions. [2024-11-08 15:32:34,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-08 15:32:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5539 transitions. [2024-11-08 15:32:34,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 15:32:34,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:34,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:34,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:32:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 15:32:34,521 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1043119000, now seen corresponding path program 1 times [2024-11-08 15:32:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249872846] [2024-11-08 15:32:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:32:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:32:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:32:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:32:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:32:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:32:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:32:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:32:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 15:32:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 15:32:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 15:32:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 15:32:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 15:32:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:35,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249872846] [2024-11-08 15:32:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249872846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:35,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992778648] [2024-11-08 15:32:35,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:35,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:35,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:35,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:35,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:32:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:35,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 15:32:35,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 30 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 15:32:35,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 15:32:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992778648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:35,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:35,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2024-11-08 15:32:35,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282188207] [2024-11-08 15:32:35,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:35,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:32:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:35,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:32:35,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:32:35,997 INFO L87 Difference]: Start difference. First operand 4248 states and 5539 transitions. Second operand has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-08 15:32:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:37,935 INFO L93 Difference]: Finished difference Result 12450 states and 16227 transitions. [2024-11-08 15:32:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 15:32:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) Word has length 154 [2024-11-08 15:32:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:37,963 INFO L225 Difference]: With dead ends: 12450 [2024-11-08 15:32:37,963 INFO L226 Difference]: Without dead ends: 8448 [2024-11-08 15:32:37,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:32:37,973 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1609 mSDsluCounter, 4073 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:37,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 4468 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:32:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8448 states. [2024-11-08 15:32:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8448 to 7021. [2024-11-08 15:32:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7021 states, 5178 states have (on average 1.3032058709926613) internal successors, (6748), 5223 states have internal predecessors, (6748), 1187 states have call successors, (1187), 655 states have call predecessors, (1187), 655 states have return successors, (1187), 1142 states have call predecessors, (1187), 1187 states have call successors, (1187) [2024-11-08 15:32:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7021 states to 7021 states and 9122 transitions. [2024-11-08 15:32:38,628 INFO L78 Accepts]: Start accepts. Automaton has 7021 states and 9122 transitions. Word has length 154 [2024-11-08 15:32:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 7021 states and 9122 transitions. [2024-11-08 15:32:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.173913043478262) internal successors, (234), 20 states have internal predecessors, (234), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-08 15:32:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7021 states and 9122 transitions. [2024-11-08 15:32:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 15:32:38,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:38,636 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:38,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:32:38,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 15:32:38,841 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:38,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1742307377, now seen corresponding path program 1 times [2024-11-08 15:32:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:38,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514540479] [2024-11-08 15:32:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:32:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:32:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:32:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:32:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:32:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:32:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:32:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:32:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 15:32:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 15:32:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 15:32:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 15:32:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 15:32:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:38,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514540479] [2024-11-08 15:32:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514540479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:38,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283473167] [2024-11-08 15:32:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:38,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:38,999 INFO L87 Difference]: Start difference. First operand 7021 states and 9122 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:32:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:40,332 INFO L93 Difference]: Finished difference Result 20675 states and 26918 transitions. [2024-11-08 15:32:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:32:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 156 [2024-11-08 15:32:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:40,388 INFO L225 Difference]: With dead ends: 20675 [2024-11-08 15:32:40,388 INFO L226 Difference]: Without dead ends: 13959 [2024-11-08 15:32:40,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:40,409 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 224 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:40,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 2584 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13959 states. [2024-11-08 15:32:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13959 to 10456. [2024-11-08 15:32:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10456 states, 7645 states have (on average 1.3005886200130805) internal successors, (9943), 7715 states have internal predecessors, (9943), 1830 states have call successors, (1830), 980 states have call predecessors, (1830), 980 states have return successors, (1830), 1760 states have call predecessors, (1830), 1830 states have call successors, (1830) [2024-11-08 15:32:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10456 states to 10456 states and 13603 transitions. [2024-11-08 15:32:42,057 INFO L78 Accepts]: Start accepts. Automaton has 10456 states and 13603 transitions. Word has length 156 [2024-11-08 15:32:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:42,058 INFO L471 AbstractCegarLoop]: Abstraction has 10456 states and 13603 transitions. [2024-11-08 15:32:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:32:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 10456 states and 13603 transitions. [2024-11-08 15:32:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-08 15:32:42,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:42,069 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 15:32:42,069 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:42,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -712568157, now seen corresponding path program 1 times [2024-11-08 15:32:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222738927] [2024-11-08 15:32:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 15:32:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:32:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:32:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:32:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:32:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:32:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:32:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 15:32:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 15:32:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 15:32:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 15:32:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 15:32:42,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222738927] [2024-11-08 15:32:42,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222738927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:42,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943308512] [2024-11-08 15:32:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:42,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:42,585 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:42,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:32:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:42,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 15:32:42,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 15:32:42,844 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:32:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943308512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:32:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-08 15:32:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060013565] [2024-11-08 15:32:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:42,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:42,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:42,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:32:42,846 INFO L87 Difference]: Start difference. First operand 10456 states and 13603 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:32:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:43,590 INFO L93 Difference]: Finished difference Result 17918 states and 23367 transitions. [2024-11-08 15:32:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:32:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 156 [2024-11-08 15:32:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:43,617 INFO L225 Difference]: With dead ends: 17918 [2024-11-08 15:32:43,617 INFO L226 Difference]: Without dead ends: 7531 [2024-11-08 15:32:43,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:32:43,632 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:43,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1488 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7531 states. [2024-11-08 15:32:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7531 to 7531. [2024-11-08 15:32:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7531 states, 5530 states have (on average 1.2965641952983724) internal successors, (7170), 5579 states have internal predecessors, (7170), 1305 states have call successors, (1305), 695 states have call predecessors, (1305), 695 states have return successors, (1305), 1256 states have call predecessors, (1305), 1305 states have call successors, (1305) [2024-11-08 15:32:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 9780 transitions. [2024-11-08 15:32:44,226 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 9780 transitions. Word has length 156 [2024-11-08 15:32:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:44,227 INFO L471 AbstractCegarLoop]: Abstraction has 7531 states and 9780 transitions. [2024-11-08 15:32:44,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:32:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 9780 transitions. [2024-11-08 15:32:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 15:32:44,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:44,237 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:44,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 15:32:44,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:44,442 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2119288524, now seen corresponding path program 1 times [2024-11-08 15:32:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361712305] [2024-11-08 15:32:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:32:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 15:32:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:32:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:32:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:32:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:32:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:32:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 15:32:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 15:32:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 15:32:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 15:32:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 15:32:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-08 15:32:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361712305] [2024-11-08 15:32:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361712305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:45,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203072072] [2024-11-08 15:32:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:45,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:45,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:32:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:32:45,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 15:32:45,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-08 15:32:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203072072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:45,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:45,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-08 15:32:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179191843] [2024-11-08 15:32:45,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 15:32:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:45,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 15:32:45,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:32:45,793 INFO L87 Difference]: Start difference. First operand 7531 states and 9780 transitions. Second operand has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-08 15:32:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:47,929 INFO L93 Difference]: Finished difference Result 19683 states and 25479 transitions. [2024-11-08 15:32:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 15:32:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) Word has length 157 [2024-11-08 15:32:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:47,963 INFO L225 Difference]: With dead ends: 19683 [2024-11-08 15:32:47,963 INFO L226 Difference]: Without dead ends: 12356 [2024-11-08 15:32:47,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2024-11-08 15:32:47,974 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1319 mSDsluCounter, 3952 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:47,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 4422 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:32:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12356 states. [2024-11-08 15:32:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12356 to 7288. [2024-11-08 15:32:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7288 states, 5336 states have (on average 1.2947901049475263) internal successors, (6909), 5386 states have internal predecessors, (6909), 1274 states have call successors, (1274), 677 states have call predecessors, (1274), 677 states have return successors, (1274), 1224 states have call predecessors, (1274), 1274 states have call successors, (1274) [2024-11-08 15:32:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 9457 transitions. [2024-11-08 15:32:48,663 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 9457 transitions. Word has length 157 [2024-11-08 15:32:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:48,663 INFO L471 AbstractCegarLoop]: Abstraction has 7288 states and 9457 transitions. [2024-11-08 15:32:48,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.642857142857142) internal successors, (205), 12 states have internal predecessors, (205), 6 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-08 15:32:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 9457 transitions. [2024-11-08 15:32:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 15:32:48,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:48,674 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:48,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:32:48,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:48,875 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:48,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1022003271, now seen corresponding path program 1 times [2024-11-08 15:32:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193112022] [2024-11-08 15:32:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:48,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:32:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:32:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:32:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:32:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:32:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:32:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:32:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:32:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 15:32:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 15:32:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 15:32:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 15:32:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 15:32:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 15:32:49,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193112022] [2024-11-08 15:32:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193112022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91761396] [2024-11-08 15:32:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:49,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:49,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:49,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:32:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 15:32:49,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 15:32:50,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 15:32:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91761396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:50,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-11-08 15:32:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359848892] [2024-11-08 15:32:50,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 15:32:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 15:32:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:32:50,753 INFO L87 Difference]: Start difference. First operand 7288 states and 9457 transitions. Second operand has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-08 15:32:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:54,233 INFO L93 Difference]: Finished difference Result 19940 states and 26014 transitions. [2024-11-08 15:32:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 15:32:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) Word has length 167 [2024-11-08 15:32:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:54,279 INFO L225 Difference]: With dead ends: 19940 [2024-11-08 15:32:54,280 INFO L226 Difference]: Without dead ends: 12946 [2024-11-08 15:32:54,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2024-11-08 15:32:54,292 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1104 mSDsluCounter, 3253 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:54,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 3666 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:32:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12946 states. [2024-11-08 15:32:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12946 to 12702. [2024-11-08 15:32:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12702 states, 9407 states have (on average 1.2976506856596153) internal successors, (12207), 9489 states have internal predecessors, (12207), 2124 states have call successors, (2124), 1170 states have call predecessors, (2124), 1170 states have return successors, (2124), 2042 states have call predecessors, (2124), 2124 states have call successors, (2124) [2024-11-08 15:32:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12702 states to 12702 states and 16455 transitions. [2024-11-08 15:32:55,688 INFO L78 Accepts]: Start accepts. Automaton has 12702 states and 16455 transitions. Word has length 167 [2024-11-08 15:32:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 12702 states and 16455 transitions. [2024-11-08 15:32:55,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.0) internal successors, (228), 18 states have internal predecessors, (228), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-08 15:32:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 12702 states and 16455 transitions. [2024-11-08 15:32:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 15:32:55,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:55,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:55,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:32:55,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-08 15:32:55,903 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:55,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 967582174, now seen corresponding path program 1 times [2024-11-08 15:32:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227766709] [2024-11-08 15:32:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:55,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:32:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:32:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:32:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:32:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:32:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:32:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:32:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:32:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:32:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:32:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 15:32:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 15:32:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 15:32:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 15:32:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 15:32:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 15:32:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227766709] [2024-11-08 15:32:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227766709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824472961] [2024-11-08 15:32:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:56,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:56,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:32:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 15:32:56,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 15:32:56,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 15:32:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824472961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:57,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:57,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 25 [2024-11-08 15:32:57,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536477057] [2024-11-08 15:32:57,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:57,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 15:32:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 15:32:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:32:57,209 INFO L87 Difference]: Start difference. First operand 12702 states and 16455 transitions. Second operand has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 15:33:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:01,188 INFO L93 Difference]: Finished difference Result 37538 states and 48562 transitions. [2024-11-08 15:33:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 15:33:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) Word has length 167 [2024-11-08 15:33:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:01,249 INFO L225 Difference]: With dead ends: 37538 [2024-11-08 15:33:01,249 INFO L226 Difference]: Without dead ends: 24828 [2024-11-08 15:33:01,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=1787, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 15:33:01,269 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 1112 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:01,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 4147 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 15:33:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24828 states. [2024-11-08 15:33:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24828 to 21002. [2024-11-08 15:33:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21002 states, 15351 states have (on average 1.293922220050811) internal successors, (19863), 15529 states have internal predecessors, (19863), 3660 states have call successors, (3660), 1990 states have call predecessors, (3660), 1990 states have return successors, (3660), 3482 states have call predecessors, (3660), 3660 states have call successors, (3660) [2024-11-08 15:33:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21002 states to 21002 states and 27183 transitions. [2024-11-08 15:33:04,379 INFO L78 Accepts]: Start accepts. Automaton has 21002 states and 27183 transitions. Word has length 167 [2024-11-08 15:33:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:04,379 INFO L471 AbstractCegarLoop]: Abstraction has 21002 states and 27183 transitions. [2024-11-08 15:33:04,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.333333333333333) internal successors, (176), 19 states have internal predecessors, (176), 5 states have call successors, (28), 4 states have call predecessors, (28), 9 states have return successors, (31), 9 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 15:33:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 21002 states and 27183 transitions. [2024-11-08 15:33:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-08 15:33:04,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:04,391 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:04,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 15:33:04,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:04,596 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:04,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1884077704, now seen corresponding path program 1 times [2024-11-08 15:33:04,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561153253] [2024-11-08 15:33:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:33:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:33:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:33:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:33:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:33:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:33:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:33:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:33:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:33:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:33:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:33:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 15:33:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 15:33:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-08 15:33:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 15:33:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 15:33:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 15:33:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:33:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561153253] [2024-11-08 15:33:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561153253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530429608] [2024-11-08 15:33:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:05,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:05,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:05,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:05,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 15:33:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-08 15:33:05,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 82 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-08 15:33:06,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:33:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:33:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530429608] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:33:07,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:33:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2024-11-08 15:33:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459712374] [2024-11-08 15:33:07,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:33:07,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 15:33:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 15:33:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:33:07,039 INFO L87 Difference]: Start difference. First operand 21002 states and 27183 transitions. Second operand has 30 states, 30 states have (on average 9.466666666666667) internal successors, (284), 30 states have internal predecessors, (284), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-08 15:33:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:14,117 INFO L93 Difference]: Finished difference Result 44525 states and 57736 transitions. [2024-11-08 15:33:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 15:33:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.466666666666667) internal successors, (284), 30 states have internal predecessors, (284), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 182 [2024-11-08 15:33:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:14,195 INFO L225 Difference]: With dead ends: 44525 [2024-11-08 15:33:14,195 INFO L226 Difference]: Without dead ends: 23848 [2024-11-08 15:33:14,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1449, Invalid=5357, Unknown=0, NotChecked=0, Total=6806 [2024-11-08 15:33:14,235 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 2615 mSDsluCounter, 3195 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 855 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 855 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:14,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2615 Valid, 3532 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [855 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 15:33:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23848 states. [2024-11-08 15:33:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23848 to 21793. [2024-11-08 15:33:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21793 states, 15930 states have (on average 1.2941619585687383) internal successors, (20616), 16114 states have internal predecessors, (20616), 3796 states have call successors, (3796), 2066 states have call predecessors, (3796), 2066 states have return successors, (3796), 3612 states have call predecessors, (3796), 3796 states have call successors, (3796) [2024-11-08 15:33:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21793 states to 21793 states and 28208 transitions. [2024-11-08 15:33:18,616 INFO L78 Accepts]: Start accepts. Automaton has 21793 states and 28208 transitions. Word has length 182 [2024-11-08 15:33:18,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 21793 states and 28208 transitions. [2024-11-08 15:33:18,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.466666666666667) internal successors, (284), 30 states have internal predecessors, (284), 10 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-08 15:33:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21793 states and 28208 transitions. [2024-11-08 15:33:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 15:33:18,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:18,624 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:18,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 15:33:18,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:18,826 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:18,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash -478725598, now seen corresponding path program 1 times [2024-11-08 15:33:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:18,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422557377] [2024-11-08 15:33:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:33:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:33:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:33:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:33:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:33:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:33:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:33:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:33:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:33:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:33:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:33:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 15:33:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 15:33:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 15:33:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-08 15:33:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 15:33:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 15:33:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:33:19,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422557377] [2024-11-08 15:33:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422557377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499363498] [2024-11-08 15:33:19,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:19,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:19,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:19,200 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:19,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 15:33:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:19,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 15:33:19,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 69 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 15:33:19,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:33:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-08 15:33:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499363498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:33:20,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:33:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 18 [2024-11-08 15:33:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510209928] [2024-11-08 15:33:20,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:33:20,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:33:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:33:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:33:20,149 INFO L87 Difference]: Start difference. First operand 21793 states and 28208 transitions. Second operand has 18 states, 18 states have (on average 15.666666666666666) internal successors, (282), 18 states have internal predecessors, (282), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-08 15:33:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:24,741 INFO L93 Difference]: Finished difference Result 43593 states and 56490 transitions. [2024-11-08 15:33:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 15:33:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 15.666666666666666) internal successors, (282), 18 states have internal predecessors, (282), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 185 [2024-11-08 15:33:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:24,828 INFO L225 Difference]: With dead ends: 43593 [2024-11-08 15:33:24,828 INFO L226 Difference]: Without dead ends: 22125 [2024-11-08 15:33:24,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=434, Invalid=972, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 15:33:24,861 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1439 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:24,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 1806 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:33:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22125 states. [2024-11-08 15:33:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22125 to 20555. [2024-11-08 15:33:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20555 states, 14992 states have (on average 1.2898212379935965) internal successors, (19337), 15167 states have internal predecessors, (19337), 3607 states have call successors, (3607), 1955 states have call predecessors, (3607), 1955 states have return successors, (3607), 3432 states have call predecessors, (3607), 3607 states have call successors, (3607) [2024-11-08 15:33:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20555 states to 20555 states and 26551 transitions. [2024-11-08 15:33:29,277 INFO L78 Accepts]: Start accepts. Automaton has 20555 states and 26551 transitions. Word has length 185 [2024-11-08 15:33:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:29,278 INFO L471 AbstractCegarLoop]: Abstraction has 20555 states and 26551 transitions. [2024-11-08 15:33:29,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.666666666666666) internal successors, (282), 18 states have internal predecessors, (282), 10 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-08 15:33:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20555 states and 26551 transitions. [2024-11-08 15:33:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 15:33:29,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:29,284 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:29,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 15:33:29,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 15:33:29,485 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash -35999417, now seen corresponding path program 1 times [2024-11-08 15:33:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356233422] [2024-11-08 15:33:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:29,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:33:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:33:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:33:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:33:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:33:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:33:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:33:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:33:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:33:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 15:33:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:33:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 15:33:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 15:33:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 15:33:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 15:33:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 15:33:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 15:33:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-08 15:33:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-08 15:33:29,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:29,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356233422] [2024-11-08 15:33:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356233422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:33:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:33:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867614698] [2024-11-08 15:33:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:33:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:33:29,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:33:29,657 INFO L87 Difference]: Start difference. First operand 20555 states and 26551 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:33:35,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:35,350 INFO L93 Difference]: Finished difference Result 46199 states and 59491 transitions. [2024-11-08 15:33:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:33:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 186 [2024-11-08 15:33:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:35,535 INFO L225 Difference]: With dead ends: 46199 [2024-11-08 15:33:35,535 INFO L226 Difference]: Without dead ends: 25969 [2024-11-08 15:33:35,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:33:35,600 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 202 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2514 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:35,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2514 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:33:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25969 states.