./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.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 32b030e5f1b46150870f8dd8e24821389f0ffe4175e43053767dc9109bffcf9b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:23:13,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:23:13,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:23:13,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:23:13,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:23:13,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:23:13,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:23:13,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:23:13,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:23:13,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:23:13,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:23:13,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:23:13,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:23:13,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:23:13,736 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:23:13,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:23:13,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:23:13,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:23:13,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:23:13,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:23:13,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:23:13,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:23:13,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:23:13,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:23:13,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:23:13,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:23:13,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:23:13,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:23:13,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:23:13,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:23:13,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:23:13,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:23:13,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:13,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:23:13,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:23:13,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:23:13,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:23:13,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:23:13,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:23:13,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:23:13,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:23:13,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:23:13,746 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 -> 32b030e5f1b46150870f8dd8e24821389f0ffe4175e43053767dc9109bffcf9b [2024-10-14 03:23:13,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:23:13,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:23:14,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:23:14,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:23:14,002 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:23:14,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2024-10-14 03:23:15,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:23:15,625 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:23:15,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2024-10-14 03:23:15,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e30291/a22642568a43431ebb5706549ae9e9af/FLAG5ddc31eca [2024-10-14 03:23:15,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b62e30291/a22642568a43431ebb5706549ae9e9af [2024-10-14 03:23:15,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:23:15,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:23:15,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:15,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:23:15,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:23:15,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:15" (1/1) ... [2024-10-14 03:23:15,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ac64d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:15, skipping insertion in model container [2024-10-14 03:23:15,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:15" (1/1) ... [2024-10-14 03:23:15,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:23:15,890 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c[671,684] [2024-10-14 03:23:15,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:15,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:23:16,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c[671,684] [2024-10-14 03:23:16,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:16,074 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:23:16,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16 WrapperNode [2024-10-14 03:23:16,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:16,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:16,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:23:16,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:23:16,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,126 INFO L138 Inliner]: procedures = 42, calls = 53, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 585 [2024-10-14 03:23:16,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:16,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:23:16,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:23:16,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:23:16,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:23:16,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:23:16,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:23:16,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:23:16,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:23:16,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (1/1) ... [2024-10-14 03:23:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:16,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:23:16,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:23:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:23:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 03:23:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 03:23:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:23:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:23:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:23:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:23:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:23:16,299 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:23:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:23:16,300 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:23:16,300 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:23:16,300 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:23:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:23:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:23:16,301 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:23:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:23:16,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:23:16,415 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:23:16,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:23:17,028 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-10-14 03:23:17,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:23:17,101 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:23:17,101 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 03:23:17,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:17 BoogieIcfgContainer [2024-10-14 03:23:17,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:23:17,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:23:17,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:23:17,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:23:17,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:23:15" (1/3) ... [2024-10-14 03:23:17,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351f3cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:17, skipping insertion in model container [2024-10-14 03:23:17,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:16" (2/3) ... [2024-10-14 03:23:17,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351f3cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:17, skipping insertion in model container [2024-10-14 03:23:17,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:17" (3/3) ... [2024-10-14 03:23:17,113 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.07.cil-2.c [2024-10-14 03:23:17,132 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:23:17,132 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:23:17,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:23:17,231 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;@2a73cc5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:23:17,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:23:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 209 states have (on average 1.722488038277512) internal successors, (360), 213 states have internal predecessors, (360), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 03:23:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:17,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:17,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:17,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash -877910029, now seen corresponding path program 1 times [2024-10-14 03:23:17,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:17,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265114927] [2024-10-14 03:23:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265114927] [2024-10-14 03:23:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265114927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:17,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450881915] [2024-10-14 03:23:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:17,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:17,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:17,924 INFO L87 Difference]: Start difference. First operand has 241 states, 209 states have (on average 1.722488038277512) internal successors, (360), 213 states have internal predecessors, (360), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:19,262 INFO L93 Difference]: Finished difference Result 555 states and 945 transitions. [2024-10-14 03:23:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:23:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:19,278 INFO L225 Difference]: With dead ends: 555 [2024-10-14 03:23:19,279 INFO L226 Difference]: Without dead ends: 318 [2024-10-14 03:23:19,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:23:19,287 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 636 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:19,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 449 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:23:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-14 03:23:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 238. [2024-10-14 03:23:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 208 states have (on average 1.6153846153846154) internal successors, (336), 210 states have internal predecessors, (336), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 03:23:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 380 transitions. [2024-10-14 03:23:19,382 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 380 transitions. Word has length 111 [2024-10-14 03:23:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:19,383 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 380 transitions. [2024-10-14 03:23:19,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2024-10-14 03:23:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:19,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:19,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:19,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:23:19,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:19,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2027763253, now seen corresponding path program 1 times [2024-10-14 03:23:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283195095] [2024-10-14 03:23:19,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:19,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283195095] [2024-10-14 03:23:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283195095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:19,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:19,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066358073] [2024-10-14 03:23:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:19,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:19,772 INFO L87 Difference]: Start difference. First operand 238 states and 380 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:21,678 INFO L93 Difference]: Finished difference Result 857 states and 1400 transitions. [2024-10-14 03:23:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:21,685 INFO L225 Difference]: With dead ends: 857 [2024-10-14 03:23:21,685 INFO L226 Difference]: Without dead ends: 632 [2024-10-14 03:23:21,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:21,689 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 954 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:21,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 750 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-14 03:23:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 471. [2024-10-14 03:23:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 418 states have (on average 1.624401913875598) internal successors, (679), 421 states have internal predecessors, (679), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-14 03:23:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 758 transitions. [2024-10-14 03:23:21,747 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 758 transitions. Word has length 111 [2024-10-14 03:23:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 758 transitions. [2024-10-14 03:23:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 758 transitions. [2024-10-14 03:23:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:21,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:21,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:23:21,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:21,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1272951247, now seen corresponding path program 1 times [2024-10-14 03:23:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638505554] [2024-10-14 03:23:21,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638505554] [2024-10-14 03:23:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638505554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:22,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:22,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706191499] [2024-10-14 03:23:22,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:22,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:22,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:22,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:22,030 INFO L87 Difference]: Start difference. First operand 471 states and 758 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:24,287 INFO L93 Difference]: Finished difference Result 1414 states and 2312 transitions. [2024-10-14 03:23:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:24,294 INFO L225 Difference]: With dead ends: 1414 [2024-10-14 03:23:24,294 INFO L226 Difference]: Without dead ends: 956 [2024-10-14 03:23:24,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:24,297 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 975 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:24,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1426 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 03:23:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-14 03:23:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 688. [2024-10-14 03:23:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.6176470588235294) internal successors, (990), 616 states have internal predecessors, (990), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 03:23:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1103 transitions. [2024-10-14 03:23:24,370 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1103 transitions. Word has length 111 [2024-10-14 03:23:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:24,371 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1103 transitions. [2024-10-14 03:23:24,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1103 transitions. [2024-10-14 03:23:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:24,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:24,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:24,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:23:24,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1403041135, now seen corresponding path program 1 times [2024-10-14 03:23:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039200400] [2024-10-14 03:23:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039200400] [2024-10-14 03:23:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039200400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156473120] [2024-10-14 03:23:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:24,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:24,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:24,606 INFO L87 Difference]: Start difference. First operand 688 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:25,667 INFO L93 Difference]: Finished difference Result 1637 states and 2675 transitions. [2024-10-14 03:23:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:25,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:25,676 INFO L225 Difference]: With dead ends: 1637 [2024-10-14 03:23:25,676 INFO L226 Difference]: Without dead ends: 962 [2024-10-14 03:23:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:25,681 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 800 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:25,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 603 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:23:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-14 03:23:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 688. [2024-10-14 03:23:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.6127450980392157) internal successors, (987), 616 states have internal predecessors, (987), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 03:23:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1100 transitions. [2024-10-14 03:23:25,743 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1100 transitions. Word has length 111 [2024-10-14 03:23:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1100 transitions. [2024-10-14 03:23:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1100 transitions. [2024-10-14 03:23:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:25,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:25,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:23:25,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:25,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 519532145, now seen corresponding path program 1 times [2024-10-14 03:23:25,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:25,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384163565] [2024-10-14 03:23:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:25,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384163565] [2024-10-14 03:23:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384163565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:25,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303614655] [2024-10-14 03:23:25,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:25,966 INFO L87 Difference]: Start difference. First operand 688 states and 1100 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:27,241 INFO L93 Difference]: Finished difference Result 1633 states and 2658 transitions. [2024-10-14 03:23:27,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:27,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:27,248 INFO L225 Difference]: With dead ends: 1633 [2024-10-14 03:23:27,248 INFO L226 Difference]: Without dead ends: 958 [2024-10-14 03:23:27,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:27,252 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 700 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:27,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 720 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:23:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-14 03:23:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 688. [2024-10-14 03:23:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.607843137254902) internal successors, (984), 616 states have internal predecessors, (984), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 03:23:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1097 transitions. [2024-10-14 03:23:27,305 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1097 transitions. Word has length 111 [2024-10-14 03:23:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:27,306 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1097 transitions. [2024-10-14 03:23:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1097 transitions. [2024-10-14 03:23:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:27,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:27,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:27,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:23:27,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 491031855, now seen corresponding path program 1 times [2024-10-14 03:23:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:27,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305100414] [2024-10-14 03:23:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305100414] [2024-10-14 03:23:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305100414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:27,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:27,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:27,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012276363] [2024-10-14 03:23:27,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:27,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:27,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:27,489 INFO L87 Difference]: Start difference. First operand 688 states and 1097 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:28,438 INFO L93 Difference]: Finished difference Result 1629 states and 2641 transitions. [2024-10-14 03:23:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:28,445 INFO L225 Difference]: With dead ends: 1629 [2024-10-14 03:23:28,445 INFO L226 Difference]: Without dead ends: 954 [2024-10-14 03:23:28,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:28,449 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 796 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:28,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 603 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-10-14 03:23:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 688. [2024-10-14 03:23:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.6029411764705883) internal successors, (981), 616 states have internal predecessors, (981), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 03:23:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1094 transitions. [2024-10-14 03:23:28,519 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1094 transitions. Word has length 111 [2024-10-14 03:23:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:28,520 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1094 transitions. [2024-10-14 03:23:28,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1094 transitions. [2024-10-14 03:23:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:28,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:28,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:28,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:23:28,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:28,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1449550159, now seen corresponding path program 1 times [2024-10-14 03:23:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:28,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842771769] [2024-10-14 03:23:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:28,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:28,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842771769] [2024-10-14 03:23:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842771769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695894979] [2024-10-14 03:23:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:28,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:28,730 INFO L87 Difference]: Start difference. First operand 688 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:30,384 INFO L93 Difference]: Finished difference Result 2216 states and 3569 transitions. [2024-10-14 03:23:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:30,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:30,394 INFO L225 Difference]: With dead ends: 2216 [2024-10-14 03:23:30,395 INFO L226 Difference]: Without dead ends: 1541 [2024-10-14 03:23:30,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:30,398 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1008 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:30,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 905 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-10-14 03:23:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1134. [2024-10-14 03:23:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1012 states have (on average 1.5948616600790513) internal successors, (1614), 1018 states have internal predecessors, (1614), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:23:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1799 transitions. [2024-10-14 03:23:30,482 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1799 transitions. Word has length 111 [2024-10-14 03:23:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:30,483 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1799 transitions. [2024-10-14 03:23:30,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1799 transitions. [2024-10-14 03:23:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:30,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:30,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:30,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:23:30,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash 427513071, now seen corresponding path program 1 times [2024-10-14 03:23:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522003308] [2024-10-14 03:23:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:30,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522003308] [2024-10-14 03:23:30,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522003308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:30,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226036738] [2024-10-14 03:23:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:30,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:30,663 INFO L87 Difference]: Start difference. First operand 1134 states and 1799 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:31,569 INFO L93 Difference]: Finished difference Result 2647 states and 4260 transitions. [2024-10-14 03:23:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:31,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:31,579 INFO L225 Difference]: With dead ends: 2647 [2024-10-14 03:23:31,579 INFO L226 Difference]: Without dead ends: 1526 [2024-10-14 03:23:31,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:31,584 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 795 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:31,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 603 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-10-14 03:23:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1134. [2024-10-14 03:23:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1012 states have (on average 1.5899209486166008) internal successors, (1609), 1018 states have internal predecessors, (1609), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 03:23:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1794 transitions. [2024-10-14 03:23:31,686 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1794 transitions. Word has length 111 [2024-10-14 03:23:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:31,687 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1794 transitions. [2024-10-14 03:23:31,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1794 transitions. [2024-10-14 03:23:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:31,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:31,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:23:31,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash -343220495, now seen corresponding path program 1 times [2024-10-14 03:23:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579651900] [2024-10-14 03:23:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:31,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579651900] [2024-10-14 03:23:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579651900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:31,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:31,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331948573] [2024-10-14 03:23:31,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:31,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:31,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:31,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:31,900 INFO L87 Difference]: Start difference. First operand 1134 states and 1794 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:33,912 INFO L93 Difference]: Finished difference Result 4152 states and 6640 transitions. [2024-10-14 03:23:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:33,927 INFO L225 Difference]: With dead ends: 4152 [2024-10-14 03:23:33,928 INFO L226 Difference]: Without dead ends: 3031 [2024-10-14 03:23:33,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:33,934 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1206 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:33,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1417 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2024-10-14 03:23:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2020. [2024-10-14 03:23:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1810 states have (on average 1.5828729281767955) internal successors, (2865), 1820 states have internal predecessors, (2865), 147 states have call successors, (147), 55 states have call predecessors, (147), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-14 03:23:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3192 transitions. [2024-10-14 03:23:34,121 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3192 transitions. Word has length 111 [2024-10-14 03:23:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:34,121 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3192 transitions. [2024-10-14 03:23:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3192 transitions. [2024-10-14 03:23:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:34,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:34,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:34,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:23:34,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:34,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1337914193, now seen corresponding path program 1 times [2024-10-14 03:23:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058114634] [2024-10-14 03:23:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058114634] [2024-10-14 03:23:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058114634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085640537] [2024-10-14 03:23:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:34,306 INFO L87 Difference]: Start difference. First operand 2020 states and 3192 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:35,392 INFO L93 Difference]: Finished difference Result 4649 states and 7435 transitions. [2024-10-14 03:23:35,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:35,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:35,407 INFO L225 Difference]: With dead ends: 4649 [2024-10-14 03:23:35,408 INFO L226 Difference]: Without dead ends: 2642 [2024-10-14 03:23:35,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:35,414 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 698 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:35,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 719 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:23:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2024-10-14 03:23:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2020. [2024-10-14 03:23:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1810 states have (on average 1.5779005524861878) internal successors, (2856), 1820 states have internal predecessors, (2856), 147 states have call successors, (147), 55 states have call predecessors, (147), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-14 03:23:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3183 transitions. [2024-10-14 03:23:35,593 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3183 transitions. Word has length 111 [2024-10-14 03:23:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:35,594 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3183 transitions. [2024-10-14 03:23:35,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3183 transitions. [2024-10-14 03:23:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:35,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:35,597 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:35,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:23:35,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:35,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash 998478317, now seen corresponding path program 1 times [2024-10-14 03:23:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:35,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739664399] [2024-10-14 03:23:35,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:35,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739664399] [2024-10-14 03:23:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739664399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:35,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665390358] [2024-10-14 03:23:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:35,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:35,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:35,779 INFO L87 Difference]: Start difference. First operand 2020 states and 3183 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:37,949 INFO L93 Difference]: Finished difference Result 7348 states and 11704 transitions. [2024-10-14 03:23:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:37,972 INFO L225 Difference]: With dead ends: 7348 [2024-10-14 03:23:37,972 INFO L226 Difference]: Without dead ends: 5341 [2024-10-14 03:23:37,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:37,980 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1089 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:37,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1417 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2024-10-14 03:23:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 3807. [2024-10-14 03:23:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3425 states have (on average 1.5737226277372263) internal successors, (5390), 3443 states have internal predecessors, (5390), 263 states have call successors, (263), 103 states have call predecessors, (263), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-14 03:23:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 6011 transitions. [2024-10-14 03:23:38,398 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 6011 transitions. Word has length 111 [2024-10-14 03:23:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 6011 transitions. [2024-10-14 03:23:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 6011 transitions. [2024-10-14 03:23:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:38,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:38,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:23:38,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:38,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1420006161, now seen corresponding path program 1 times [2024-10-14 03:23:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147694111] [2024-10-14 03:23:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147694111] [2024-10-14 03:23:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147694111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750433297] [2024-10-14 03:23:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:38,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:38,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:38,608 INFO L87 Difference]: Start difference. First operand 3807 states and 6011 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:41,086 INFO L93 Difference]: Finished difference Result 13837 states and 22082 transitions. [2024-10-14 03:23:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:41,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:41,128 INFO L225 Difference]: With dead ends: 13837 [2024-10-14 03:23:41,128 INFO L226 Difference]: Without dead ends: 10043 [2024-10-14 03:23:41,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:41,142 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 963 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:41,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1417 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10043 states. [2024-10-14 03:23:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10043 to 7376. [2024-10-14 03:23:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7376 states, 6658 states have (on average 1.5716431360768999) internal successors, (10464), 6692 states have internal predecessors, (10464), 487 states have call successors, (487), 199 states have call predecessors, (487), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-14 03:23:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 11711 transitions. [2024-10-14 03:23:41,847 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 11711 transitions. Word has length 111 [2024-10-14 03:23:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:41,847 INFO L471 AbstractCegarLoop]: Abstraction has 7376 states and 11711 transitions. [2024-10-14 03:23:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 11711 transitions. [2024-10-14 03:23:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:41,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:41,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:23:41,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 995830189, now seen corresponding path program 1 times [2024-10-14 03:23:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403855016] [2024-10-14 03:23:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403855016] [2024-10-14 03:23:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403855016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:42,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:42,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:42,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985871213] [2024-10-14 03:23:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:42,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:42,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:42,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:42,009 INFO L87 Difference]: Start difference. First operand 7376 states and 11711 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:43,246 INFO L93 Difference]: Finished difference Result 16659 states and 26752 transitions. [2024-10-14 03:23:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:43,286 INFO L225 Difference]: With dead ends: 16659 [2024-10-14 03:23:43,286 INFO L226 Difference]: Without dead ends: 9296 [2024-10-14 03:23:43,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:43,308 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 796 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:43,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 602 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:23:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9296 states. [2024-10-14 03:23:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9296 to 7376. [2024-10-14 03:23:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7376 states, 6658 states have (on average 1.5666866927005108) internal successors, (10431), 6692 states have internal predecessors, (10431), 487 states have call successors, (487), 199 states have call predecessors, (487), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-14 03:23:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7376 states to 7376 states and 11678 transitions. [2024-10-14 03:23:44,040 INFO L78 Accepts]: Start accepts. Automaton has 7376 states and 11678 transitions. Word has length 111 [2024-10-14 03:23:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:44,041 INFO L471 AbstractCegarLoop]: Abstraction has 7376 states and 11678 transitions. [2024-10-14 03:23:44,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7376 states and 11678 transitions. [2024-10-14 03:23:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:44,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:44,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:44,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:23:44,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1974280913, now seen corresponding path program 1 times [2024-10-14 03:23:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981505168] [2024-10-14 03:23:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:44,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:44,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981505168] [2024-10-14 03:23:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981505168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:44,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352921332] [2024-10-14 03:23:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:44,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:44,209 INFO L87 Difference]: Start difference. First operand 7376 states and 11678 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:47,148 INFO L93 Difference]: Finished difference Result 26154 states and 41824 transitions. [2024-10-14 03:23:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:47,218 INFO L225 Difference]: With dead ends: 26154 [2024-10-14 03:23:47,218 INFO L226 Difference]: Without dead ends: 18791 [2024-10-14 03:23:47,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:47,245 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 980 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:47,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 905 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:23:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18791 states. [2024-10-14 03:23:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18791 to 14546. [2024-10-14 03:23:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14546 states, 13172 states have (on average 1.5647585788035225) internal successors, (20611), 13238 states have internal predecessors, (20611), 919 states have call successors, (919), 391 states have call predecessors, (919), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-14 03:23:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14546 states to 14546 states and 23240 transitions. [2024-10-14 03:23:48,426 INFO L78 Accepts]: Start accepts. Automaton has 14546 states and 23240 transitions. Word has length 111 [2024-10-14 03:23:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 14546 states and 23240 transitions. [2024-10-14 03:23:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 14546 states and 23240 transitions. [2024-10-14 03:23:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:48,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:48,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:23:48,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash -407522963, now seen corresponding path program 1 times [2024-10-14 03:23:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987992229] [2024-10-14 03:23:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:48,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:48,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987992229] [2024-10-14 03:23:48,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987992229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:48,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:48,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192183928] [2024-10-14 03:23:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:48,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:48,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:48,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:48,623 INFO L87 Difference]: Start difference. First operand 14546 states and 23240 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:53,194 INFO L93 Difference]: Finished difference Result 50762 states and 81976 transitions. [2024-10-14 03:23:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:23:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:53,360 INFO L225 Difference]: With dead ends: 50762 [2024-10-14 03:23:53,360 INFO L226 Difference]: Without dead ends: 36229 [2024-10-14 03:23:53,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:53,418 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 936 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:53,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1417 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36229 states. [2024-10-14 03:23:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36229 to 28883. [2024-10-14 03:23:55,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28883 states, 26229 states have (on average 1.5642609325555683) internal successors, (41029), 26359 states have internal predecessors, (41029), 1751 states have call successors, (1751), 775 states have call predecessors, (1751), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-14 03:23:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28883 states to 28883 states and 46844 transitions. [2024-10-14 03:23:55,474 INFO L78 Accepts]: Start accepts. Automaton has 28883 states and 46844 transitions. Word has length 111 [2024-10-14 03:23:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:55,475 INFO L471 AbstractCegarLoop]: Abstraction has 28883 states and 46844 transitions. [2024-10-14 03:23:55,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28883 states and 46844 transitions. [2024-10-14 03:23:55,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:23:55,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:55,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:55,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:23:55,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1465361041, now seen corresponding path program 1 times [2024-10-14 03:23:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:55,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944295363] [2024-10-14 03:23:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:55,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:23:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:23:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:23:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:23:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944295363] [2024-10-14 03:23:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944295363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852232038] [2024-10-14 03:23:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:55,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:55,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:55,631 INFO L87 Difference]: Start difference. First operand 28883 states and 46844 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:01,590 INFO L93 Difference]: Finished difference Result 98303 states and 159170 transitions. [2024-10-14 03:24:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:24:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-14 03:24:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:01,849 INFO L225 Difference]: With dead ends: 98303 [2024-10-14 03:24:01,849 INFO L226 Difference]: Without dead ends: 69434 [2024-10-14 03:24:01,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:24:01,945 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1198 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:01,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 1055 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 03:24:01,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69434 states. [2024-10-14 03:24:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69434 to 56457. [2024-10-14 03:24:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56457 states, 51156 states have (on average 1.5507467354757996) internal successors, (79330), 51543 states have internal predecessors, (79330), 3496 states have call successors, (3496), 1549 states have call predecessors, (3496), 1804 states have return successors, (7997), 3492 states have call predecessors, (7997), 3494 states have call successors, (7997) [2024-10-14 03:24:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56457 states to 56457 states and 90823 transitions. [2024-10-14 03:24:07,225 INFO L78 Accepts]: Start accepts. Automaton has 56457 states and 90823 transitions. Word has length 111 [2024-10-14 03:24:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:07,226 INFO L471 AbstractCegarLoop]: Abstraction has 56457 states and 90823 transitions. [2024-10-14 03:24:07,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:24:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 56457 states and 90823 transitions. [2024-10-14 03:24:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-14 03:24:07,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:07,346 INFO L215 NwaCegarLoop]: trace histogram [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, 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-10-14 03:24:07,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:24:07,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash -214330943, now seen corresponding path program 1 times [2024-10-14 03:24:07,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:07,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405696499] [2024-10-14 03:24:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:24:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:24:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:24:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:24:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 03:24:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:24:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 03:24:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:24:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405696499] [2024-10-14 03:24:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405696499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:24:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553114931] [2024-10-14 03:24:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:24:07,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:24:07,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:24:07,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:24:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:07,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:24:07,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:24:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-14 03:24:07,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:24:07,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553114931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:07,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:24:07,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:24:07,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180683803] [2024-10-14 03:24:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:07,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:24:07,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:07,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:24:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:07,812 INFO L87 Difference]: Start difference. First operand 56457 states and 90823 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:24:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:24:15,048 INFO L93 Difference]: Finished difference Result 168566 states and 272941 transitions. [2024-10-14 03:24:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 179 [2024-10-14 03:24:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:15,631 INFO L225 Difference]: With dead ends: 168566 [2024-10-14 03:24:15,631 INFO L226 Difference]: Without dead ends: 112123 [2024-10-14 03:24:15,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:15,841 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 320 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:15,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 712 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:24:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112123 states.