./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:18:36,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:18:36,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:18:36,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:18:36,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:18:36,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:18:36,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:18:36,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:18:36,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:18:36,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:18:36,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:18:36,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:18:36,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:18:36,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:18:36,244 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:18:36,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:18:36,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:18:36,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:18:36,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:18:36,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:18:36,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:18:36,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:18:36,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:18:36,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:18:36,252 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:18:36,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:18:36,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:18:36,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:18:36,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:18:36,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:18:36,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:18:36,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:18:36,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:36,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:18:36,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:18:36,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:18:36,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:18:36,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:18:36,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:18:36,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:18:36,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:18:36,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:18:36,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2024-10-24 01:18:36,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:18:36,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:18:36,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:18:36,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:18:36,578 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:18:36,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:38,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:18:38,230 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:18:38,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:38,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7077ddd06/4bc97ab18312487abc872306fc2c4c48/FLAG8f5c43aa0 [2024-10-24 01:18:38,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7077ddd06/4bc97ab18312487abc872306fc2c4c48 [2024-10-24 01:18:38,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:18:38,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:18:38,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:38,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:18:38,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:18:38,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:38" (1/1) ... [2024-10-24 01:18:38,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477de43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:38, skipping insertion in model container [2024-10-24 01:18:38,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:38" (1/1) ... [2024-10-24 01:18:38,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:18:38,898 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-10-24 01:18:38,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:38,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:18:38,975 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c[14684,14697] [2024-10-24 01:18:38,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:39,010 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:18:39,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39 WrapperNode [2024-10-24 01:18:39,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:39,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:39,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:18:39,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:18:39,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,068 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 507 [2024-10-24 01:18:39,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:39,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:18:39,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:18:39,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:18:39,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,110 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-24 01:18:39,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:18:39,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:18:39,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:18:39,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:18:39,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (1/1) ... [2024-10-24 01:18:39,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:39,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:18:39,188 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-24 01:18:39,195 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-24 01:18:39,240 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-24 01:18:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-24 01:18:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:18:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-24 01:18:39,241 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-24 01:18:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 01:18:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 01:18:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-24 01:18:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-24 01:18:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 01:18:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 01:18:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:18:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-24 01:18:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-24 01:18:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:18:39,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:18:39,244 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-24 01:18:39,245 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-24 01:18:39,377 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:18:39,379 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:18:40,037 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-10-24 01:18:40,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:18:40,103 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:18:40,104 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:18:40,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:40 BoogieIcfgContainer [2024-10-24 01:18:40,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:18:40,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:18:40,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:18:40,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:18:40,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:18:38" (1/3) ... [2024-10-24 01:18:40,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:40, skipping insertion in model container [2024-10-24 01:18:40,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:39" (2/3) ... [2024-10-24 01:18:40,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:40, skipping insertion in model container [2024-10-24 01:18:40,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:40" (3/3) ... [2024-10-24 01:18:40,114 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2024-10-24 01:18:40,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:18:40,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:18:40,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:18:40,196 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;@5328261a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:18:40,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:18:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:40,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:40,213 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] [2024-10-24 01:18:40,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash 975176766, now seen corresponding path program 1 times [2024-10-24 01:18:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451264945] [2024-10-24 01:18:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:40,513 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-24 01:18:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451264945] [2024-10-24 01:18:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451264945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:18:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024655283] [2024-10-24 01:18:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:40,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:18:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:18:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:40,551 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.6) internal successors, (208), 132 states have internal predecessors, (208), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:40,652 INFO L93 Difference]: Finished difference Result 323 states and 540 transitions. [2024-10-24 01:18:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:18:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:40,682 INFO L225 Difference]: With dead ends: 323 [2024-10-24 01:18:40,682 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 01:18:40,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:40,712 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:40,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 01:18:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-24 01:18:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.573643410852713) internal successors, (203), 130 states have internal predecessors, (203), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 265 transitions. [2024-10-24 01:18:40,783 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 265 transitions. Word has length 23 [2024-10-24 01:18:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:40,783 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 265 transitions. [2024-10-24 01:18:40,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 265 transitions. [2024-10-24 01:18:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:40,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:40,788 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] [2024-10-24 01:18:40,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:18:40,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:40,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1018967940, now seen corresponding path program 1 times [2024-10-24 01:18:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527969893] [2024-10-24 01:18:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,101 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-24 01:18:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527969893] [2024-10-24 01:18:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527969893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857480324] [2024-10-24 01:18:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:41,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:41,105 INFO L87 Difference]: Start difference. First operand 168 states and 265 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:41,211 INFO L93 Difference]: Finished difference Result 323 states and 505 transitions. [2024-10-24 01:18:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:18:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:41,215 INFO L225 Difference]: With dead ends: 323 [2024-10-24 01:18:41,215 INFO L226 Difference]: Without dead ends: 168 [2024-10-24 01:18:41,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:41,218 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:41,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1260 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-24 01:18:41,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-24 01:18:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 130 states have internal predecessors, (191), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2024-10-24 01:18:41,238 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 23 [2024-10-24 01:18:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2024-10-24 01:18:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2024-10-24 01:18:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:18:41,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:41,240 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] [2024-10-24 01:18:41,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:18:41,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:41,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 26280683, now seen corresponding path program 1 times [2024-10-24 01:18:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668197719] [2024-10-24 01:18:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,508 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-24 01:18:41,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:41,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668197719] [2024-10-24 01:18:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668197719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:41,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423797686] [2024-10-24 01:18:41,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:41,510 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:41,611 INFO L93 Difference]: Finished difference Result 324 states and 497 transitions. [2024-10-24 01:18:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-24 01:18:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:41,615 INFO L225 Difference]: With dead ends: 324 [2024-10-24 01:18:41,615 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 01:18:41,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:41,619 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:41,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 716 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 01:18:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-10-24 01:18:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.4696969696969697) internal successors, (194), 133 states have internal predecessors, (194), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2024-10-24 01:18:41,643 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 34 [2024-10-24 01:18:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:41,643 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2024-10-24 01:18:41,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2024-10-24 01:18:41,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:18:41,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:41,648 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:41,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:18:41,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:41,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1285077620, now seen corresponding path program 1 times [2024-10-24 01:18:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25616148] [2024-10-24 01:18:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:18:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:41,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25616148] [2024-10-24 01:18:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25616148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851723346] [2024-10-24 01:18:41,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:41,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:41,767 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:41,825 INFO L93 Difference]: Finished difference Result 473 states and 714 transitions. [2024-10-24 01:18:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-24 01:18:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:41,829 INFO L225 Difference]: With dead ends: 473 [2024-10-24 01:18:41,831 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 01:18:41,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:41,834 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:41,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 495 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 01:18:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-10-24 01:18:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 239 states have internal predecessors, (352), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 01:18:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2024-10-24 01:18:41,880 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 48 [2024-10-24 01:18:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:41,882 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2024-10-24 01:18:41,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2024-10-24 01:18:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:41,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:41,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:41,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:18:41,886 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:41,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:41,887 INFO L85 PathProgramCache]: Analyzing trace with hash -271052700, now seen corresponding path program 1 times [2024-10-24 01:18:41,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:41,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242727939] [2024-10-24 01:18:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:41,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242727939] [2024-10-24 01:18:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242727939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544291929] [2024-10-24 01:18:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:41,986 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:42,077 INFO L93 Difference]: Finished difference Result 886 states and 1342 transitions. [2024-10-24 01:18:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:42,085 INFO L225 Difference]: With dead ends: 886 [2024-10-24 01:18:42,086 INFO L226 Difference]: Without dead ends: 588 [2024-10-24 01:18:42,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:42,090 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 210 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:42,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-10-24 01:18:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 582. [2024-10-24 01:18:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 433 states have (on average 1.4942263279445727) internal successors, (647), 437 states have internal predecessors, (647), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 881 transitions. [2024-10-24 01:18:42,149 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 881 transitions. Word has length 49 [2024-10-24 01:18:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 881 transitions. [2024-10-24 01:18:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 881 transitions. [2024-10-24 01:18:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:42,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:42,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:42,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:18:42,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:42,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1550916378, now seen corresponding path program 1 times [2024-10-24 01:18:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051737653] [2024-10-24 01:18:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:42,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051737653] [2024-10-24 01:18:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051737653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:42,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620147859] [2024-10-24 01:18:42,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:42,310 INFO L87 Difference]: Start difference. First operand 582 states and 881 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:42,498 INFO L93 Difference]: Finished difference Result 1237 states and 1874 transitions. [2024-10-24 01:18:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:42,506 INFO L225 Difference]: With dead ends: 1237 [2024-10-24 01:18:42,506 INFO L226 Difference]: Without dead ends: 671 [2024-10-24 01:18:42,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:42,510 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:42,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-24 01:18:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 663. [2024-10-24 01:18:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 501 states have (on average 1.4810379241516967) internal successors, (742), 504 states have internal predecessors, (742), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 990 transitions. [2024-10-24 01:18:42,557 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 990 transitions. Word has length 49 [2024-10-24 01:18:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:42,557 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 990 transitions. [2024-10-24 01:18:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 990 transitions. [2024-10-24 01:18:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:18:42,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:42,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:42,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:18:42,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1743107091, now seen corresponding path program 1 times [2024-10-24 01:18:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021895765] [2024-10-24 01:18:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 01:18:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021895765] [2024-10-24 01:18:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021895765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14890369] [2024-10-24 01:18:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:42,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:42,720 INFO L87 Difference]: Start difference. First operand 663 states and 990 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:42,900 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2024-10-24 01:18:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:42,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-24 01:18:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:42,905 INFO L225 Difference]: With dead ends: 1241 [2024-10-24 01:18:42,905 INFO L226 Difference]: Without dead ends: 675 [2024-10-24 01:18:42,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:42,908 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 347 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:42,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:42,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-24 01:18:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 671. [2024-10-24 01:18:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 512 states have internal predecessors, (750), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 998 transitions. [2024-10-24 01:18:42,952 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 998 transitions. Word has length 50 [2024-10-24 01:18:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:42,952 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 998 transitions. [2024-10-24 01:18:42,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 998 transitions. [2024-10-24 01:18:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:18:42,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:42,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:42,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:18:42,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1020972895, now seen corresponding path program 1 times [2024-10-24 01:18:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436042805] [2024-10-24 01:18:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 01:18:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436042805] [2024-10-24 01:18:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436042805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:43,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103142169] [2024-10-24 01:18:43,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:43,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:43,154 INFO L87 Difference]: Start difference. First operand 671 states and 998 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:43,309 INFO L93 Difference]: Finished difference Result 1237 states and 1862 transitions. [2024-10-24 01:18:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-24 01:18:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:43,314 INFO L225 Difference]: With dead ends: 1237 [2024-10-24 01:18:43,315 INFO L226 Difference]: Without dead ends: 671 [2024-10-24 01:18:43,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:43,317 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 58 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:43,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 640 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-24 01:18:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2024-10-24 01:18:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 509 states have (on average 1.4656188605108056) internal successors, (746), 512 states have internal predecessors, (746), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 994 transitions. [2024-10-24 01:18:43,385 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 994 transitions. Word has length 52 [2024-10-24 01:18:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:43,385 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 994 transitions. [2024-10-24 01:18:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 994 transitions. [2024-10-24 01:18:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:18:43,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:43,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:43,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:18:43,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:43,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 70077876, now seen corresponding path program 1 times [2024-10-24 01:18:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:43,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858022934] [2024-10-24 01:18:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:43,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858022934] [2024-10-24 01:18:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858022934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:43,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:43,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:43,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221129751] [2024-10-24 01:18:43,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:43,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:43,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:43,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:43,606 INFO L87 Difference]: Start difference. First operand 671 states and 994 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:43,693 INFO L93 Difference]: Finished difference Result 1257 states and 1886 transitions. [2024-10-24 01:18:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:43,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-24 01:18:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:43,698 INFO L225 Difference]: With dead ends: 1257 [2024-10-24 01:18:43,698 INFO L226 Difference]: Without dead ends: 691 [2024-10-24 01:18:43,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:43,701 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:43,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2024-10-24 01:18:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2024-10-24 01:18:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 525 states have (on average 1.4514285714285715) internal successors, (762), 528 states have internal predecessors, (762), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1010 transitions. [2024-10-24 01:18:43,744 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1010 transitions. Word has length 53 [2024-10-24 01:18:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:43,744 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1010 transitions. [2024-10-24 01:18:43,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1010 transitions. [2024-10-24 01:18:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:18:43,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:43,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:18:43,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:43,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2022849498, now seen corresponding path program 1 times [2024-10-24 01:18:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:43,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251585113] [2024-10-24 01:18:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251585113] [2024-10-24 01:18:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251585113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:43,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376831768] [2024-10-24 01:18:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:43,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:43,934 INFO L87 Difference]: Start difference. First operand 691 states and 1010 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:44,038 INFO L93 Difference]: Finished difference Result 1297 states and 1930 transitions. [2024-10-24 01:18:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-24 01:18:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:44,044 INFO L225 Difference]: With dead ends: 1297 [2024-10-24 01:18:44,045 INFO L226 Difference]: Without dead ends: 711 [2024-10-24 01:18:44,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:44,049 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:44,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-10-24 01:18:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2024-10-24 01:18:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 541 states have (on average 1.4380776340110906) internal successors, (778), 544 states have internal predecessors, (778), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1026 transitions. [2024-10-24 01:18:44,093 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1026 transitions. Word has length 61 [2024-10-24 01:18:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:44,095 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1026 transitions. [2024-10-24 01:18:44,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1026 transitions. [2024-10-24 01:18:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:44,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:44,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:44,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:18:44,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1319245148, now seen corresponding path program 1 times [2024-10-24 01:18:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867218675] [2024-10-24 01:18:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:44,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867218675] [2024-10-24 01:18:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867218675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310142074] [2024-10-24 01:18:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:44,293 INFO L87 Difference]: Start difference. First operand 711 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:44,399 INFO L93 Difference]: Finished difference Result 1333 states and 1946 transitions. [2024-10-24 01:18:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:44,405 INFO L225 Difference]: With dead ends: 1333 [2024-10-24 01:18:44,405 INFO L226 Difference]: Without dead ends: 727 [2024-10-24 01:18:44,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:44,409 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:44,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-24 01:18:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-10-24 01:18:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 553 states have (on average 1.4285714285714286) internal successors, (790), 556 states have internal predecessors, (790), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1038 transitions. [2024-10-24 01:18:44,454 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1038 transitions. Word has length 69 [2024-10-24 01:18:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:44,454 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1038 transitions. [2024-10-24 01:18:44,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1038 transitions. [2024-10-24 01:18:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:44,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:44,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:44,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:18:44,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:44,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:44,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1077214155, now seen corresponding path program 1 times [2024-10-24 01:18:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:44,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300841026] [2024-10-24 01:18:44,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:44,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:44,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300841026] [2024-10-24 01:18:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300841026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:44,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659866026] [2024-10-24 01:18:44,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:44,652 INFO L87 Difference]: Start difference. First operand 727 states and 1038 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:44,746 INFO L93 Difference]: Finished difference Result 1369 states and 1986 transitions. [2024-10-24 01:18:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:44,769 INFO L225 Difference]: With dead ends: 1369 [2024-10-24 01:18:44,769 INFO L226 Difference]: Without dead ends: 747 [2024-10-24 01:18:44,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:44,772 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:44,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 714 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2024-10-24 01:18:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2024-10-24 01:18:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 569 states have (on average 1.4165202108963093) internal successors, (806), 572 states have internal predecessors, (806), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1054 transitions. [2024-10-24 01:18:44,816 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1054 transitions. Word has length 69 [2024-10-24 01:18:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:44,816 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1054 transitions. [2024-10-24 01:18:44,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1054 transitions. [2024-10-24 01:18:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:18:44,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:44,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:44,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:18:44,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:44,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash 371503403, now seen corresponding path program 1 times [2024-10-24 01:18:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:44,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484329658] [2024-10-24 01:18:44,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:18:45,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484329658] [2024-10-24 01:18:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484329658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:45,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:45,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541173446] [2024-10-24 01:18:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:45,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:45,031 INFO L87 Difference]: Start difference. First operand 747 states and 1054 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:45,116 INFO L93 Difference]: Finished difference Result 1413 states and 2014 transitions. [2024-10-24 01:18:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-24 01:18:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:45,125 INFO L225 Difference]: With dead ends: 1413 [2024-10-24 01:18:45,125 INFO L226 Difference]: Without dead ends: 771 [2024-10-24 01:18:45,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:45,129 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:45,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 726 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-24 01:18:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2024-10-24 01:18:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 589 states have (on average 1.4023769100169778) internal successors, (826), 592 states have internal predecessors, (826), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:45,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1074 transitions. [2024-10-24 01:18:45,185 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1074 transitions. Word has length 77 [2024-10-24 01:18:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:45,185 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 1074 transitions. [2024-10-24 01:18:45,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1074 transitions. [2024-10-24 01:18:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:18:45,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:45,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:45,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:18:45,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1261624674, now seen corresponding path program 1 times [2024-10-24 01:18:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684215186] [2024-10-24 01:18:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684215186] [2024-10-24 01:18:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684215186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:45,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:45,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506288806] [2024-10-24 01:18:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:45,723 INFO L87 Difference]: Start difference. First operand 771 states and 1074 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:46,010 INFO L93 Difference]: Finished difference Result 1995 states and 2765 transitions. [2024-10-24 01:18:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:46,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-24 01:18:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:46,018 INFO L225 Difference]: With dead ends: 1995 [2024-10-24 01:18:46,018 INFO L226 Difference]: Without dead ends: 1329 [2024-10-24 01:18:46,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:46,020 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:46,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1404 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:18:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2024-10-24 01:18:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1047. [2024-10-24 01:18:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 792 states have (on average 1.3888888888888888) internal successors, (1100), 797 states have internal predecessors, (1100), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1444 transitions. [2024-10-24 01:18:46,090 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1444 transitions. Word has length 80 [2024-10-24 01:18:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:46,090 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1444 transitions. [2024-10-24 01:18:46,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1444 transitions. [2024-10-24 01:18:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:18:46,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:46,092 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:46,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:18:46,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash 203336820, now seen corresponding path program 1 times [2024-10-24 01:18:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575841110] [2024-10-24 01:18:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:46,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:46,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575841110] [2024-10-24 01:18:46,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575841110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:46,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786139090] [2024-10-24 01:18:46,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:46,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:46,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:46,269 INFO L87 Difference]: Start difference. First operand 1047 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:46,396 INFO L93 Difference]: Finished difference Result 1953 states and 2714 transitions. [2024-10-24 01:18:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 01:18:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:46,403 INFO L225 Difference]: With dead ends: 1953 [2024-10-24 01:18:46,403 INFO L226 Difference]: Without dead ends: 1071 [2024-10-24 01:18:46,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:46,405 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:46,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 724 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-24 01:18:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-24 01:18:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 810 states have (on average 1.3802469135802469) internal successors, (1118), 815 states have internal predecessors, (1118), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1462 transitions. [2024-10-24 01:18:46,474 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1462 transitions. Word has length 84 [2024-10-24 01:18:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:46,474 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1462 transitions. [2024-10-24 01:18:46,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1462 transitions. [2024-10-24 01:18:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:18:46,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:46,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:46,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:18:46,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:46,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1117244196, now seen corresponding path program 1 times [2024-10-24 01:18:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:46,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035933968] [2024-10-24 01:18:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:46,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035933968] [2024-10-24 01:18:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035933968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:46,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:46,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103142226] [2024-10-24 01:18:46,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:46,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:46,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:46,814 INFO L87 Difference]: Start difference. First operand 1071 states and 1462 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,084 INFO L93 Difference]: Finished difference Result 1485 states and 2136 transitions. [2024-10-24 01:18:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:47,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-24 01:18:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,094 INFO L225 Difference]: With dead ends: 1485 [2024-10-24 01:18:47,094 INFO L226 Difference]: Without dead ends: 1483 [2024-10-24 01:18:47,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:47,096 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 259 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2482 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-10-24 01:18:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1079. [2024-10-24 01:18:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 814 states have (on average 1.3783783783783783) internal successors, (1122), 821 states have internal predecessors, (1122), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 01:18:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1470 transitions. [2024-10-24 01:18:47,194 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1470 transitions. Word has length 83 [2024-10-24 01:18:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,194 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1470 transitions. [2024-10-24 01:18:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1470 transitions. [2024-10-24 01:18:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:18:47,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:18:47,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1786856787, now seen corresponding path program 1 times [2024-10-24 01:18:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923035863] [2024-10-24 01:18:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 01:18:47,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923035863] [2024-10-24 01:18:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923035863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389383841] [2024-10-24 01:18:47,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:47,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:47,357 INFO L87 Difference]: Start difference. First operand 1079 states and 1470 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,605 INFO L93 Difference]: Finished difference Result 1945 states and 2661 transitions. [2024-10-24 01:18:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-24 01:18:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,612 INFO L225 Difference]: With dead ends: 1945 [2024-10-24 01:18:47,612 INFO L226 Difference]: Without dead ends: 1113 [2024-10-24 01:18:47,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:18:47,615 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 244 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1421 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-24 01:18:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1071. [2024-10-24 01:18:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 817 states have (on average 1.3733170134638923) internal successors, (1122), 829 states have internal predecessors, (1122), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-24 01:18:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1446 transitions. [2024-10-24 01:18:47,697 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1446 transitions. Word has length 86 [2024-10-24 01:18:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,698 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1446 transitions. [2024-10-24 01:18:47,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1446 transitions. [2024-10-24 01:18:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:18:47,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:47,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:18:47,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 116448996, now seen corresponding path program 1 times [2024-10-24 01:18:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634582516] [2024-10-24 01:18:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634582516] [2024-10-24 01:18:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634582516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268256869] [2024-10-24 01:18:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:48,221 INFO L87 Difference]: Start difference. First operand 1071 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:48,461 INFO L93 Difference]: Finished difference Result 1911 states and 2591 transitions. [2024-10-24 01:18:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:48,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-24 01:18:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:48,471 INFO L225 Difference]: With dead ends: 1911 [2024-10-24 01:18:48,471 INFO L226 Difference]: Without dead ends: 1067 [2024-10-24 01:18:48,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:48,473 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 145 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:48,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2024-10-24 01:18:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 964. [2024-10-24 01:18:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 737 states have (on average 1.3772048846675713) internal successors, (1015), 747 states have internal predecessors, (1015), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-24 01:18:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1305 transitions. [2024-10-24 01:18:48,587 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1305 transitions. Word has length 88 [2024-10-24 01:18:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:48,588 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1305 transitions. [2024-10-24 01:18:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1305 transitions. [2024-10-24 01:18:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 01:18:48,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:48,590 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:48,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:18:48,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:48,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:48,591 INFO L85 PathProgramCache]: Analyzing trace with hash -741171965, now seen corresponding path program 1 times [2024-10-24 01:18:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:48,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632570228] [2024-10-24 01:18:48,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 01:18:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:49,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:49,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632570228] [2024-10-24 01:18:49,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632570228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:49,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:49,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719240388] [2024-10-24 01:18:49,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:49,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:49,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:49,162 INFO L87 Difference]: Start difference. First operand 964 states and 1305 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:49,699 INFO L93 Difference]: Finished difference Result 1859 states and 2511 transitions. [2024-10-24 01:18:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-24 01:18:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:49,706 INFO L225 Difference]: With dead ends: 1859 [2024-10-24 01:18:49,706 INFO L226 Difference]: Without dead ends: 1051 [2024-10-24 01:18:49,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:49,708 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 659 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:49,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1351 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:18:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-24 01:18:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1002. [2024-10-24 01:18:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 760 states have (on average 1.3539473684210526) internal successors, (1029), 771 states have internal predecessors, (1029), 154 states have call successors, (154), 87 states have call predecessors, (154), 87 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2024-10-24 01:18:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1337 transitions. [2024-10-24 01:18:49,798 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1337 transitions. Word has length 89 [2024-10-24 01:18:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:49,799 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1337 transitions. [2024-10-24 01:18:49,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1337 transitions. [2024-10-24 01:18:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 01:18:49,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:49,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:49,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:18:49,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:49,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1765724356, now seen corresponding path program 1 times [2024-10-24 01:18:49,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:49,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747216607] [2024-10-24 01:18:49,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:49,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:18:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:18:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:18:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:18:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 01:18:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 01:18:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:50,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747216607] [2024-10-24 01:18:50,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747216607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:50,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:50,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283304652] [2024-10-24 01:18:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:50,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:50,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:50,297 INFO L87 Difference]: Start difference. First operand 1002 states and 1337 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:50,827 INFO L93 Difference]: Finished difference Result 1942 states and 2575 transitions. [2024-10-24 01:18:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-10-24 01:18:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:50,834 INFO L225 Difference]: With dead ends: 1942 [2024-10-24 01:18:50,834 INFO L226 Difference]: Without dead ends: 1109 [2024-10-24 01:18:50,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:50,837 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 520 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:50,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1339 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2024-10-24 01:18:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1024. [2024-10-24 01:18:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 774 states have (on average 1.3372093023255813) internal successors, (1035), 786 states have internal predecessors, (1035), 157 states have call successors, (157), 92 states have call predecessors, (157), 92 states have return successors, (157), 145 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-24 01:18:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1349 transitions. [2024-10-24 01:18:50,933 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1349 transitions. Word has length 91 [2024-10-24 01:18:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:50,933 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1349 transitions. [2024-10-24 01:18:50,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1349 transitions. [2024-10-24 01:18:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 01:18:50,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:50,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:50,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:18:50,935 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1782988361, now seen corresponding path program 1 times [2024-10-24 01:18:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806522354] [2024-10-24 01:18:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:18:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:18:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:18:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:18:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:18:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:18:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:51,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:51,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806522354] [2024-10-24 01:18:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806522354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956842087] [2024-10-24 01:18:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:51,042 INFO L87 Difference]: Start difference. First operand 1024 states and 1349 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:51,297 INFO L93 Difference]: Finished difference Result 2682 states and 3557 transitions. [2024-10-24 01:18:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:51,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-24 01:18:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:51,308 INFO L225 Difference]: With dead ends: 2682 [2024-10-24 01:18:51,308 INFO L226 Difference]: Without dead ends: 1905 [2024-10-24 01:18:51,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:51,311 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 195 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:51,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-10-24 01:18:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1734. [2024-10-24 01:18:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1296 states have (on average 1.3356481481481481) internal successors, (1731), 1316 states have internal predecessors, (1731), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-24 01:18:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2291 transitions. [2024-10-24 01:18:51,482 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2291 transitions. Word has length 92 [2024-10-24 01:18:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:51,483 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2291 transitions. [2024-10-24 01:18:51,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2291 transitions. [2024-10-24 01:18:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:51,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:51,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:51,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:18:51,485 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 890629356, now seen corresponding path program 1 times [2024-10-24 01:18:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112731379] [2024-10-24 01:18:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:18:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:18:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:18:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:18:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:18:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:18:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112731379] [2024-10-24 01:18:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112731379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458320347] [2024-10-24 01:18:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:51,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:51,621 INFO L87 Difference]: Start difference. First operand 1734 states and 2291 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:52,037 INFO L93 Difference]: Finished difference Result 4412 states and 5861 transitions. [2024-10-24 01:18:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:52,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-24 01:18:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:52,054 INFO L225 Difference]: With dead ends: 4412 [2024-10-24 01:18:52,055 INFO L226 Difference]: Without dead ends: 2994 [2024-10-24 01:18:52,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:52,062 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 202 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:52,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-10-24 01:18:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2745. [2024-10-24 01:18:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2032 states have (on average 1.3228346456692914) internal successors, (2688), 2063 states have internal predecessors, (2688), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-24 01:18:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3608 transitions. [2024-10-24 01:18:52,380 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3608 transitions. Word has length 94 [2024-10-24 01:18:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:52,381 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 3608 transitions. [2024-10-24 01:18:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3608 transitions. [2024-10-24 01:18:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:52,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:52,387 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:52,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:18:52,388 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:52,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1142837102, now seen corresponding path program 1 times [2024-10-24 01:18:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871480963] [2024-10-24 01:18:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 01:18:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 01:18:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 01:18:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 01:18:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 01:18:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 01:18:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871480963] [2024-10-24 01:18:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871480963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289050709] [2024-10-24 01:18:52,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:52,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:52,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:52,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:52,507 INFO L87 Difference]: Start difference. First operand 2745 states and 3608 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:52,948 INFO L93 Difference]: Finished difference Result 6428 states and 8486 transitions. [2024-10-24 01:18:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-24 01:18:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:52,973 INFO L225 Difference]: With dead ends: 6428 [2024-10-24 01:18:52,973 INFO L226 Difference]: Without dead ends: 4115 [2024-10-24 01:18:52,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:52,980 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 196 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:52,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1146 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2024-10-24 01:18:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3942. [2024-10-24 01:18:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2905 states have (on average 1.3180722891566266) internal successors, (3829), 2949 states have internal predecessors, (3829), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-24 01:18:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5173 transitions. [2024-10-24 01:18:53,409 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5173 transitions. Word has length 94 [2024-10-24 01:18:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:53,410 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 5173 transitions. [2024-10-24 01:18:53,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5173 transitions. [2024-10-24 01:18:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:18:53,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:53,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:18:53,413 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -116500221, now seen corresponding path program 1 times [2024-10-24 01:18:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:53,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181727779] [2024-10-24 01:18:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:18:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:18:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:18:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:18:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:18:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:18:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181727779] [2024-10-24 01:18:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181727779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:53,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616298284] [2024-10-24 01:18:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:53,479 INFO L87 Difference]: Start difference. First operand 3942 states and 5173 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:53,866 INFO L93 Difference]: Finished difference Result 7585 states and 9999 transitions. [2024-10-24 01:18:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-24 01:18:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:53,891 INFO L225 Difference]: With dead ends: 7585 [2024-10-24 01:18:53,892 INFO L226 Difference]: Without dead ends: 3975 [2024-10-24 01:18:53,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:53,904 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:53,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2024-10-24 01:18:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3948. [2024-10-24 01:18:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 2911 states have (on average 1.3174166952937134) internal successors, (3835), 2955 states have internal predecessors, (3835), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-24 01:18:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5179 transitions. [2024-10-24 01:18:54,491 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5179 transitions. Word has length 95 [2024-10-24 01:18:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:54,492 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 5179 transitions. [2024-10-24 01:18:54,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5179 transitions. [2024-10-24 01:18:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 01:18:54,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:54,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:18:54,496 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1006279155, now seen corresponding path program 1 times [2024-10-24 01:18:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694090842] [2024-10-24 01:18:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:54,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 01:18:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 01:18:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 01:18:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 01:18:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 01:18:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 01:18:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694090842] [2024-10-24 01:18:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694090842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:54,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:54,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56619413] [2024-10-24 01:18:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:54,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:54,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:54,634 INFO L87 Difference]: Start difference. First operand 3948 states and 5179 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:55,019 INFO L93 Difference]: Finished difference Result 7551 states and 9927 transitions. [2024-10-24 01:18:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-10-24 01:18:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:55,039 INFO L225 Difference]: With dead ends: 7551 [2024-10-24 01:18:55,039 INFO L226 Difference]: Without dead ends: 3669 [2024-10-24 01:18:55,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:55,051 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 78 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:55,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 711 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2024-10-24 01:18:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3606. [2024-10-24 01:18:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 2652 states have (on average 1.3273001508295625) internal successors, (3520), 2686 states have internal predecessors, (3520), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-24 01:18:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 4760 transitions. [2024-10-24 01:18:55,442 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 4760 transitions. Word has length 96 [2024-10-24 01:18:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:55,443 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 4760 transitions. [2024-10-24 01:18:55,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 4760 transitions. [2024-10-24 01:18:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 01:18:55,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:55,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:55,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:18:55,445 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 976654501, now seen corresponding path program 1 times [2024-10-24 01:18:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:55,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218972183] [2024-10-24 01:18:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:18:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:18:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:18:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:18:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:18:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:18:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:55,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218972183] [2024-10-24 01:18:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218972183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:55,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837345994] [2024-10-24 01:18:55,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:55,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:55,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:55,519 INFO L87 Difference]: Start difference. First operand 3606 states and 4760 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:55,895 INFO L93 Difference]: Finished difference Result 7053 states and 9341 transitions. [2024-10-24 01:18:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:55,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-24 01:18:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:55,913 INFO L225 Difference]: With dead ends: 7053 [2024-10-24 01:18:55,913 INFO L226 Difference]: Without dead ends: 3616 [2024-10-24 01:18:55,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:55,923 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:55,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-10-24 01:18:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 3616. [2024-10-24 01:18:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 2662 states have (on average 1.3260706235912847) internal successors, (3530), 2696 states have internal predecessors, (3530), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-24 01:18:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 4770 transitions. [2024-10-24 01:18:56,269 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 4770 transitions. Word has length 97 [2024-10-24 01:18:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 4770 transitions. [2024-10-24 01:18:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 4770 transitions. [2024-10-24 01:18:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 01:18:56,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:56,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:18:56,272 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1105968182, now seen corresponding path program 1 times [2024-10-24 01:18:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871020661] [2024-10-24 01:18:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:18:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:18:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:18:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:18:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:18:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:18:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871020661] [2024-10-24 01:18:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871020661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:56,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:56,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45329858] [2024-10-24 01:18:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:56,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:56,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:56,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:56,417 INFO L87 Difference]: Start difference. First operand 3616 states and 4770 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:56,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:56,707 INFO L93 Difference]: Finished difference Result 7044 states and 9312 transitions. [2024-10-24 01:18:56,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:56,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-24 01:18:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:56,723 INFO L225 Difference]: With dead ends: 7044 [2024-10-24 01:18:56,724 INFO L226 Difference]: Without dead ends: 3537 [2024-10-24 01:18:56,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:56,732 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:56,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 716 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2024-10-24 01:18:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 2729. [2024-10-24 01:18:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2009 states have (on average 1.320059731209557) internal successors, (2652), 2028 states have internal predecessors, (2652), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-24 01:18:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 3590 transitions. [2024-10-24 01:18:57,058 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 3590 transitions. Word has length 97 [2024-10-24 01:18:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 3590 transitions. [2024-10-24 01:18:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3590 transitions. [2024-10-24 01:18:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 01:18:57,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:57,064 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:18:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:18:57,064 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:57,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1294447064, now seen corresponding path program 1 times [2024-10-24 01:18:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927556172] [2024-10-24 01:18:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 01:18:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:18:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 01:18:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 01:18:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 01:18:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 01:18:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 01:18:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:18:57,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927556172] [2024-10-24 01:18:57,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927556172] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:18:57,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953270787] [2024-10-24 01:18:57,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:18:57,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:18:57,898 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-24 01:18:57,900 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-24 01:18:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 01:18:58,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:18:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:18:58,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:18:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:18:58,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953270787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:18:58,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:18:58,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 23 [2024-10-24 01:18:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467686330] [2024-10-24 01:18:58,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:18:58,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 01:18:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 01:18:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:18:58,848 INFO L87 Difference]: Start difference. First operand 2729 states and 3590 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) [2024-10-24 01:19:00,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:00,799 INFO L93 Difference]: Finished difference Result 9056 states and 11922 transitions. [2024-10-24 01:19:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 01:19:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) Word has length 140 [2024-10-24 01:19:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:00,831 INFO L225 Difference]: With dead ends: 9056 [2024-10-24 01:19:00,831 INFO L226 Difference]: Without dead ends: 6553 [2024-10-24 01:19:00,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 01:19:00,840 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 1448 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:00,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 3168 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:19:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2024-10-24 01:19:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 5780. [2024-10-24 01:19:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5780 states, 4230 states have (on average 1.315839243498818) internal successors, (5566), 4271 states have internal predecessors, (5566), 1008 states have call successors, (1008), 541 states have call predecessors, (1008), 541 states have return successors, (1008), 967 states have call predecessors, (1008), 1008 states have call successors, (1008) [2024-10-24 01:19:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5780 states to 5780 states and 7582 transitions. [2024-10-24 01:19:01,435 INFO L78 Accepts]: Start accepts. Automaton has 5780 states and 7582 transitions. Word has length 140 [2024-10-24 01:19:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:01,436 INFO L471 AbstractCegarLoop]: Abstraction has 5780 states and 7582 transitions. [2024-10-24 01:19:01,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 20 states have internal predecessors, (203), 9 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 12 states have call predecessors, (39), 9 states have call successors, (39) [2024-10-24 01:19:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5780 states and 7582 transitions. [2024-10-24 01:19:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 01:19:01,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:01,445 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:01,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:19:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 01:19:01,647 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1933689089, now seen corresponding path program 1 times [2024-10-24 01:19:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:01,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537236091] [2024-10-24 01:19:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 01:19:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 01:19:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 01:19:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 01:19:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 01:19:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 01:19:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537236091] [2024-10-24 01:19:01,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537236091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908650008] [2024-10-24 01:19:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:01,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:19:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 01:19:02,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 41 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-24 01:19:02,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 01:19:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908650008] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 01:19:02,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 9] total 15 [2024-10-24 01:19:02,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222290660] [2024-10-24 01:19:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:02,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:19:02,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:19:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:19:02,393 INFO L87 Difference]: Start difference. First operand 5780 states and 7582 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 01:19:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:02,875 INFO L93 Difference]: Finished difference Result 10040 states and 13226 transitions. [2024-10-24 01:19:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:19:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 142 [2024-10-24 01:19:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:02,906 INFO L225 Difference]: With dead ends: 10040 [2024-10-24 01:19:02,906 INFO L226 Difference]: Without dead ends: 4409 [2024-10-24 01:19:02,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:19:02,924 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:02,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 727 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-10-24 01:19:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4370. [2024-10-24 01:19:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4370 states, 3214 states have (on average 1.3189172370877411) internal successors, (4239), 3242 states have internal predecessors, (4239), 751 states have call successors, (751), 404 states have call predecessors, (751), 404 states have return successors, (751), 723 states have call predecessors, (751), 751 states have call successors, (751) [2024-10-24 01:19:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 5741 transitions. [2024-10-24 01:19:03,430 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 5741 transitions. Word has length 142 [2024-10-24 01:19:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:03,431 INFO L471 AbstractCegarLoop]: Abstraction has 4370 states and 5741 transitions. [2024-10-24 01:19:03,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 01:19:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 5741 transitions. [2024-10-24 01:19:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 01:19:03,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:03,440 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:03,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 01:19:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 01:19:03,641 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1495348114, now seen corresponding path program 1 times [2024-10-24 01:19:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256470567] [2024-10-24 01:19:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 01:19:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 01:19:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 01:19:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 01:19:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 01:19:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 01:19:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:03,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256470567] [2024-10-24 01:19:03,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256470567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:03,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786295620] [2024-10-24 01:19:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:03,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:03,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:03,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:03,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:19:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:04,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-24 01:19:04,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 58 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:04,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:06,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786295620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:06,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:06,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 17] total 32 [2024-10-24 01:19:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355398080] [2024-10-24 01:19:06,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:06,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 01:19:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:06,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 01:19:06,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-10-24 01:19:06,098 INFO L87 Difference]: Start difference. First operand 4370 states and 5741 transitions. Second operand has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) [2024-10-24 01:19:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:11,013 INFO L93 Difference]: Finished difference Result 10791 states and 14222 transitions. [2024-10-24 01:19:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-24 01:19:11,014 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) Word has length 143 [2024-10-24 01:19:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:11,042 INFO L225 Difference]: With dead ends: 10791 [2024-10-24 01:19:11,042 INFO L226 Difference]: Without dead ends: 6662 [2024-10-24 01:19:11,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1314, Invalid=5328, Unknown=0, NotChecked=0, Total=6642 [2024-10-24 01:19:11,055 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 3270 mSDsluCounter, 6377 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 1072 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3270 SdHoareTripleChecker+Valid, 6977 SdHoareTripleChecker+Invalid, 4343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1072 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:11,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3270 Valid, 6977 Invalid, 4343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1072 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 01:19:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2024-10-24 01:19:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 5431. [2024-10-24 01:19:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4002 states have (on average 1.3130934532733634) internal successors, (5255), 4036 states have internal predecessors, (5255), 921 states have call successors, (921), 507 states have call predecessors, (921), 507 states have return successors, (921), 887 states have call predecessors, (921), 921 states have call successors, (921) [2024-10-24 01:19:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 7097 transitions. [2024-10-24 01:19:11,573 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 7097 transitions. Word has length 143 [2024-10-24 01:19:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:11,573 INFO L471 AbstractCegarLoop]: Abstraction has 5431 states and 7097 transitions. [2024-10-24 01:19:11,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.09375) internal successors, (227), 31 states have internal predecessors, (227), 11 states have call successors, (42), 5 states have call predecessors, (42), 7 states have return successors, (41), 12 states have call predecessors, (41), 11 states have call successors, (41) [2024-10-24 01:19:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 7097 transitions. [2024-10-24 01:19:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 01:19:11,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:11,582 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:11,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:11,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:11,787 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -219679473, now seen corresponding path program 1 times [2024-10-24 01:19:11,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445500304] [2024-10-24 01:19:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 01:19:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 01:19:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 01:19:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:19:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 01:19:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 01:19:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 01:19:11,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:11,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445500304] [2024-10-24 01:19:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445500304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:19:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62998809] [2024-10-24 01:19:11,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:11,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:19:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:11,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:19:11,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:19:11,968 INFO L87 Difference]: Start difference. First operand 5431 states and 7097 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 01:19:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:13,015 INFO L93 Difference]: Finished difference Result 15545 states and 20379 transitions. [2024-10-24 01:19:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:19:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2024-10-24 01:19:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:13,062 INFO L225 Difference]: With dead ends: 15545 [2024-10-24 01:19:13,063 INFO L226 Difference]: Without dead ends: 10711 [2024-10-24 01:19:13,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:19:13,077 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 218 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:13,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2458 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10711 states. [2024-10-24 01:19:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10711 to 8057. [2024-10-24 01:19:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8057 states, 5886 states have (on average 1.309208290859667) internal successors, (7706), 5939 states have internal predecessors, (7706), 1416 states have call successors, (1416), 754 states have call predecessors, (1416), 754 states have return successors, (1416), 1363 states have call predecessors, (1416), 1416 states have call successors, (1416) [2024-10-24 01:19:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8057 states to 8057 states and 10538 transitions. [2024-10-24 01:19:14,047 INFO L78 Accepts]: Start accepts. Automaton has 8057 states and 10538 transitions. Word has length 145 [2024-10-24 01:19:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:14,048 INFO L471 AbstractCegarLoop]: Abstraction has 8057 states and 10538 transitions. [2024-10-24 01:19:14,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 01:19:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8057 states and 10538 transitions. [2024-10-24 01:19:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 01:19:14,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:14,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:14,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:19:14,069 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:14,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:14,069 INFO L85 PathProgramCache]: Analyzing trace with hash -280793397, now seen corresponding path program 1 times [2024-10-24 01:19:14,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747072275] [2024-10-24 01:19:14,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:19:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:19:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:19:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:19:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 01:19:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 01:19:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 01:19:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 01:19:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 01:19:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:19:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 01:19:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 01:19:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747072275] [2024-10-24 01:19:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747072275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496789682] [2024-10-24 01:19:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:15,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:15,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:19:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:15,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 01:19:15,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:15,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 01:19:15,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496789682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:15,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-24 01:19:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380641849] [2024-10-24 01:19:15,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:15,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 01:19:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 01:19:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-24 01:19:15,886 INFO L87 Difference]: Start difference. First operand 8057 states and 10538 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-24 01:19:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:20,609 INFO L93 Difference]: Finished difference Result 17261 states and 22582 transitions. [2024-10-24 01:19:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-24 01:19:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 145 [2024-10-24 01:19:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:20,653 INFO L225 Difference]: With dead ends: 17261 [2024-10-24 01:19:20,653 INFO L226 Difference]: Without dead ends: 9569 [2024-10-24 01:19:20,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1171, Invalid=5801, Unknown=0, NotChecked=0, Total=6972 [2024-10-24 01:19:20,674 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 2280 mSDsluCounter, 6231 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 799 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2280 SdHoareTripleChecker+Valid, 6723 SdHoareTripleChecker+Invalid, 3874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 799 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:20,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2280 Valid, 6723 Invalid, 3874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [799 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 01:19:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9569 states. [2024-10-24 01:19:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9569 to 5588. [2024-10-24 01:19:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 4106 states have (on average 1.303214807598636) internal successors, (5351), 4142 states have internal predecessors, (5351), 965 states have call successors, (965), 516 states have call predecessors, (965), 516 states have return successors, (965), 929 states have call predecessors, (965), 965 states have call successors, (965) [2024-10-24 01:19:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 7281 transitions. [2024-10-24 01:19:21,512 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 7281 transitions. Word has length 145 [2024-10-24 01:19:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 5588 states and 7281 transitions. [2024-10-24 01:19:21,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 24 states have internal predecessors, (254), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-24 01:19:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 7281 transitions. [2024-10-24 01:19:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 01:19:21,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:21,520 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:21,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 01:19:21,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:21,721 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 895353044, now seen corresponding path program 1 times [2024-10-24 01:19:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910643527] [2024-10-24 01:19:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 01:19:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 01:19:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 01:19:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 01:19:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:19:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 01:19:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910643527] [2024-10-24 01:19:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910643527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:22,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547806183] [2024-10-24 01:19:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:22,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:22,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:22,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 01:19:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:22,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 01:19:22,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:22,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547806183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:23,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:23,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-10-24 01:19:23,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194644319] [2024-10-24 01:19:23,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:23,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 01:19:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 01:19:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-10-24 01:19:23,020 INFO L87 Difference]: Start difference. First operand 5588 states and 7281 transitions. Second operand has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-24 01:19:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:27,946 INFO L93 Difference]: Finished difference Result 14867 states and 19530 transitions. [2024-10-24 01:19:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-24 01:19:27,947 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) Word has length 147 [2024-10-24 01:19:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:27,990 INFO L225 Difference]: With dead ends: 14867 [2024-10-24 01:19:27,990 INFO L226 Difference]: Without dead ends: 9535 [2024-10-24 01:19:28,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7723 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2714, Invalid=18456, Unknown=0, NotChecked=0, Total=21170 [2024-10-24 01:19:28,012 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 2754 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 2821 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 2821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:28,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2754 Valid, 4618 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 2821 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 01:19:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9535 states. [2024-10-24 01:19:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9535 to 8577. [2024-10-24 01:19:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8577 states, 6370 states have (on average 1.3023547880690738) internal successors, (8296), 6423 states have internal predecessors, (8296), 1421 states have call successors, (1421), 785 states have call predecessors, (1421), 785 states have return successors, (1421), 1368 states have call predecessors, (1421), 1421 states have call successors, (1421) [2024-10-24 01:19:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8577 states to 8577 states and 11138 transitions. [2024-10-24 01:19:29,031 INFO L78 Accepts]: Start accepts. Automaton has 8577 states and 11138 transitions. Word has length 147 [2024-10-24 01:19:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:29,032 INFO L471 AbstractCegarLoop]: Abstraction has 8577 states and 11138 transitions. [2024-10-24 01:19:29,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.0) internal successors, (230), 22 states have internal predecessors, (230), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (38), 10 states have call predecessors, (38), 9 states have call successors, (38) [2024-10-24 01:19:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8577 states and 11138 transitions. [2024-10-24 01:19:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 01:19:29,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:29,040 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:29,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 01:19:29,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-24 01:19:29,241 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1170692189, now seen corresponding path program 1 times [2024-10-24 01:19:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602744604] [2024-10-24 01:19:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 01:19:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 01:19:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 01:19:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 01:19:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:19:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 01:19:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:30,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602744604] [2024-10-24 01:19:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602744604] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77926348] [2024-10-24 01:19:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:30,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:30,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 01:19:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 01:19:30,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 01:19:30,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-24 01:19:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77926348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:30,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-24 01:19:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64498603] [2024-10-24 01:19:30,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:30,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 01:19:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:30,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 01:19:30,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:19:30,436 INFO L87 Difference]: Start difference. First operand 8577 states and 11138 transitions. Second operand has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-24 01:19:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:32,993 INFO L93 Difference]: Finished difference Result 17733 states and 23016 transitions. [2024-10-24 01:19:32,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 01:19:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) Word has length 147 [2024-10-24 01:19:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:33,032 INFO L225 Difference]: With dead ends: 17733 [2024-10-24 01:19:33,033 INFO L226 Difference]: Without dead ends: 9324 [2024-10-24 01:19:33,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=1311, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 01:19:33,053 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 821 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:33,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3166 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:19:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9324 states. [2024-10-24 01:19:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9324 to 9150. [2024-10-24 01:19:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9150 states, 6797 states have (on average 1.3013094012064146) internal successors, (8845), 6854 states have internal predecessors, (8845), 1513 states have call successors, (1513), 839 states have call predecessors, (1513), 839 states have return successors, (1513), 1456 states have call predecessors, (1513), 1513 states have call successors, (1513) [2024-10-24 01:19:34,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9150 states to 9150 states and 11871 transitions. [2024-10-24 01:19:34,377 INFO L78 Accepts]: Start accepts. Automaton has 9150 states and 11871 transitions. Word has length 147 [2024-10-24 01:19:34,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:34,377 INFO L471 AbstractCegarLoop]: Abstraction has 9150 states and 11871 transitions. [2024-10-24 01:19:34,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.6) internal successors, (174), 14 states have internal predecessors, (174), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-24 01:19:34,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9150 states and 11871 transitions. [2024-10-24 01:19:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:19:34,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:34,386 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-24 01:19:34,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:34,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:34,587 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash 677273251, now seen corresponding path program 1 times [2024-10-24 01:19:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:34,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449177514] [2024-10-24 01:19:34,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 01:19:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:19:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 01:19:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 01:19:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 01:19:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 01:19:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 01:19:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:19:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 01:19:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 01:19:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 01:19:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 01:19:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 01:19:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:34,812 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-24 01:19:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449177514] [2024-10-24 01:19:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449177514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:34,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301413113] [2024-10-24 01:19:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:34,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:34,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 01:19:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:35,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 01:19:35,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 8 proven. 94 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 01:19:35,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-24 01:19:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301413113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:35,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-24 01:19:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137355813] [2024-10-24 01:19:35,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:35,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 01:19:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 01:19:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:19:35,358 INFO L87 Difference]: Start difference. First operand 9150 states and 11871 transitions. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 01:19:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:37,124 INFO L93 Difference]: Finished difference Result 23130 states and 29771 transitions. [2024-10-24 01:19:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:19:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 156 [2024-10-24 01:19:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:37,178 INFO L225 Difference]: With dead ends: 23130 [2024-10-24 01:19:37,178 INFO L226 Difference]: Without dead ends: 14244 [2024-10-24 01:19:37,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 338 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:19:37,202 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 347 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:37,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1837 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14244 states. [2024-10-24 01:19:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14244 to 12026. [2024-10-24 01:19:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12026 states, 8973 states have (on average 1.288086481667224) internal successors, (11558), 9056 states have internal predecessors, (11558), 1936 states have call successors, (1936), 1116 states have call predecessors, (1936), 1116 states have return successors, (1936), 1853 states have call predecessors, (1936), 1936 states have call successors, (1936) [2024-10-24 01:19:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12026 states to 12026 states and 15430 transitions. [2024-10-24 01:19:38,930 INFO L78 Accepts]: Start accepts. Automaton has 12026 states and 15430 transitions. Word has length 156 [2024-10-24 01:19:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:38,931 INFO L471 AbstractCegarLoop]: Abstraction has 12026 states and 15430 transitions. [2024-10-24 01:19:38,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 9 states have internal predecessors, (134), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-24 01:19:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 12026 states and 15430 transitions. [2024-10-24 01:19:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 01:19:38,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:38,940 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:38,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 01:19:39,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:39,141 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:39,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:39,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1509517602, now seen corresponding path program 1 times [2024-10-24 01:19:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:39,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541091231] [2024-10-24 01:19:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:19:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 01:19:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 01:19:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 01:19:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 01:19:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 01:19:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-24 01:19:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-24 01:19:39,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541091231] [2024-10-24 01:19:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541091231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471311431] [2024-10-24 01:19:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:39,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:39,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 01:19:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:39,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 01:19:39,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 01:19:40,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-24 01:19:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471311431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:40,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-24 01:19:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915596985] [2024-10-24 01:19:40,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:40,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:19:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:19:40,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:19:40,717 INFO L87 Difference]: Start difference. First operand 12026 states and 15430 transitions. Second operand has 22 states, 21 states have (on average 11.619047619047619) internal successors, (244), 20 states have internal predecessors, (244), 10 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 10 states have call successors, (39) [2024-10-24 01:19:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:44,860 INFO L93 Difference]: Finished difference Result 28556 states and 36365 transitions. [2024-10-24 01:19:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-24 01:19:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 11.619047619047619) internal successors, (244), 20 states have internal predecessors, (244), 10 states have call successors, (40), 6 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 10 states have call successors, (39) Word has length 156 [2024-10-24 01:19:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:44,921 INFO L225 Difference]: With dead ends: 28556 [2024-10-24 01:19:44,921 INFO L226 Difference]: Without dead ends: 16755 [2024-10-24 01:19:44,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2792, Unknown=0, NotChecked=0, Total=3540 [2024-10-24 01:19:44,949 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1300 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:44,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 3189 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:19:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16755 states.