./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 860bc4cce2f799c86d6f50223334fb7e75a2513f716d902687ae93b4a9d6cb3b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:22:17,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:22:17,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:22:17,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:22:17,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:22:17,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:22:17,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:22:17,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:22:17,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:22:17,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:22:17,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:22:17,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:22:17,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:22:17,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:22:17,857 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:22:17,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:22:17,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:22:17,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:22:17,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:22:17,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:22:17,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:22:17,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:22:17,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:22:17,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:22:17,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:22:17,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:22:17,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:22:17,862 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:22:17,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:22:17,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:22:17,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:22:17,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:22:17,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:17,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:22:17,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:22:17,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:22:17,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:22:17,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:22:17,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:22:17,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:22:17,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:22:17,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:22:17,867 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-clean/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-clean/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 -> 860bc4cce2f799c86d6f50223334fb7e75a2513f716d902687ae93b4a9d6cb3b [2024-10-11 04:22:18,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:22:18,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:22:18,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:22:18,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:22:18,183 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:22:18,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-1.c [2024-10-11 04:22:19,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:22:20,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:22:20,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.06.cil-1.c [2024-10-11 04:22:20,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/026016659/73a5b58fdc01474a82bdfdcd2a91168c/FLAG345b51e04 [2024-10-11 04:22:20,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/026016659/73a5b58fdc01474a82bdfdcd2a91168c [2024-10-11 04:22:20,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:22:20,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:22:20,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:20,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:22:20,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:22:20,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:20" (1/1) ... [2024-10-11 04:22:20,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7343f42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:20, skipping insertion in model container [2024-10-11 04:22:20,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:20" (1/1) ... [2024-10-11 04:22:20,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:22:22,256 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/combinations/Problem05_label46+token_ring.06.cil-1.c[382357,382370] [2024-10-11 04:22:22,282 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/combinations/Problem05_label46+token_ring.06.cil-1.c[383339,383352] [2024-10-11 04:22:22,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:22,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:22:23,322 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/combinations/Problem05_label46+token_ring.06.cil-1.c[382357,382370] [2024-10-11 04:22:23,326 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/combinations/Problem05_label46+token_ring.06.cil-1.c[383339,383352] [2024-10-11 04:22:23,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:23,411 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:22:23,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23 WrapperNode [2024-10-11 04:22:23,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:23,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:23,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:22:23,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:22:23,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:23,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,002 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 12879 [2024-10-11 04:22:24,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:24,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:22:24,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:22:24,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:22:24,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,196 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-11 04:22:24,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:22:24,575 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:22:24,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:22:24,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:22:24,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (1/1) ... [2024-10-11 04:22:24,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:24,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:22:24,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:22:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:22:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:22:24,667 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:22:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:22:24,668 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:22:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:22:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:22:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:22:24,669 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:22:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:22:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:22:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:22:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:22:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:22:24,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:22:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:22:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:22:24,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:22:24,812 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:22:24,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:22:32,546 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2024-10-11 04:22:32,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:22:32,666 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:22:32,666 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 04:22:32,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:32 BoogieIcfgContainer [2024-10-11 04:22:32,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:22:32,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:22:32,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:22:32,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:22:32,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:22:20" (1/3) ... [2024-10-11 04:22:32,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d38539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:32, skipping insertion in model container [2024-10-11 04:22:32,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:23" (2/3) ... [2024-10-11 04:22:32,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d38539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:32, skipping insertion in model container [2024-10-11 04:22:32,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:32" (3/3) ... [2024-10-11 04:22:32,678 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.06.cil-1.c [2024-10-11 04:22:32,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:22:32,699 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:22:32,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:22:32,824 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;@60d66006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:22:32,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:22:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 2341 states, 2309 states have (on average 1.8817669987007362) internal successors, (4345), 2314 states have internal predecessors, (4345), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 04:22:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:32,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:32,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:32,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:32,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash -300332103, now seen corresponding path program 1 times [2024-10-11 04:22:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:32,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484369632] [2024-10-11 04:22:32,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:32,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:33,360 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-11 04:22:33,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484369632] [2024-10-11 04:22:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484369632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:33,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:22:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619311660] [2024-10-11 04:22:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:22:33,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:22:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:22:33,406 INFO L87 Difference]: Start difference. First operand has 2341 states, 2309 states have (on average 1.8817669987007362) internal successors, (4345), 2314 states have internal predecessors, (4345), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:34,743 INFO L93 Difference]: Finished difference Result 4743 states and 8886 transitions. [2024-10-11 04:22:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:22:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:34,775 INFO L225 Difference]: With dead ends: 4743 [2024-10-11 04:22:34,776 INFO L226 Difference]: Without dead ends: 2406 [2024-10-11 04:22:34,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:22:34,796 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 567 mSDsluCounter, 12090 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 16244 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:34,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 16244 Invalid, 648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:22:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2024-10-11 04:22:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2336. [2024-10-11 04:22:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2306 states have (on average 1.8460537727666955) internal successors, (4257), 2309 states have internal predecessors, (4257), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 04:22:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 4299 transitions. [2024-10-11 04:22:34,969 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 4299 transitions. Word has length 102 [2024-10-11 04:22:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:34,970 INFO L471 AbstractCegarLoop]: Abstraction has 2336 states and 4299 transitions. [2024-10-11 04:22:34,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 4299 transitions. [2024-10-11 04:22:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:34,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:34,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:34,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:22:34,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:34,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:34,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1640249911, now seen corresponding path program 1 times [2024-10-11 04:22:34,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:34,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060740482] [2024-10-11 04:22:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:34,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:35,364 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-11 04:22:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060740482] [2024-10-11 04:22:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060740482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:35,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449034659] [2024-10-11 04:22:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:35,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:35,372 INFO L87 Difference]: Start difference. First operand 2336 states and 4299 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:37,801 INFO L93 Difference]: Finished difference Result 2902 states and 5234 transitions. [2024-10-11 04:22:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:22:37,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:37,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:37,818 INFO L225 Difference]: With dead ends: 2902 [2024-10-11 04:22:37,819 INFO L226 Difference]: Without dead ends: 2699 [2024-10-11 04:22:37,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:22:37,823 INFO L432 NwaCegarLoop]: 4263 mSDtfsCounter, 4757 mSDsluCounter, 16816 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 21079 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:37,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 21079 Invalid, 2245 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:22:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2024-10-11 04:22:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2548. [2024-10-11 04:22:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2493 states have (on average 1.829923786602487) internal successors, (4562), 2498 states have internal predecessors, (4562), 39 states have call successors, (39), 13 states have call predecessors, (39), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-11 04:22:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 4645 transitions. [2024-10-11 04:22:38,032 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 4645 transitions. Word has length 102 [2024-10-11 04:22:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 2548 states and 4645 transitions. [2024-10-11 04:22:38,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 4645 transitions. [2024-10-11 04:22:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:38,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:38,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:38,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:22:38,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:38,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -318324875, now seen corresponding path program 1 times [2024-10-11 04:22:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21275948] [2024-10-11 04:22:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:38,271 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-11 04:22:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:38,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21275948] [2024-10-11 04:22:38,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21275948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:38,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:38,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138526930] [2024-10-11 04:22:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:38,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:38,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:38,274 INFO L87 Difference]: Start difference. First operand 2548 states and 4645 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:40,254 INFO L93 Difference]: Finished difference Result 3616 states and 6396 transitions. [2024-10-11 04:22:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:22:40,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:40,276 INFO L225 Difference]: With dead ends: 3616 [2024-10-11 04:22:40,277 INFO L226 Difference]: Without dead ends: 3203 [2024-10-11 04:22:40,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:22:40,285 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 4782 mSDsluCounter, 16764 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4795 SdHoareTripleChecker+Valid, 20989 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:40,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4795 Valid, 20989 Invalid, 2050 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:22:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2024-10-11 04:22:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 2936. [2024-10-11 04:22:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.8022559041240747) internal successors, (5113), 2844 states have internal predecessors, (5113), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:22:40,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5266 transitions. [2024-10-11 04:22:40,405 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5266 transitions. Word has length 102 [2024-10-11 04:22:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:40,406 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5266 transitions. [2024-10-11 04:22:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5266 transitions. [2024-10-11 04:22:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:40,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:40,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:22:40,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1558157943, now seen corresponding path program 1 times [2024-10-11 04:22:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:40,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033322250] [2024-10-11 04:22:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:40,642 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-11 04:22:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033322250] [2024-10-11 04:22:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033322250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741175777] [2024-10-11 04:22:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:40,647 INFO L87 Difference]: Start difference. First operand 2936 states and 5266 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:41,746 INFO L93 Difference]: Finished difference Result 4009 states and 7040 transitions. [2024-10-11 04:22:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:41,765 INFO L225 Difference]: With dead ends: 4009 [2024-10-11 04:22:41,765 INFO L226 Difference]: Without dead ends: 3206 [2024-10-11 04:22:41,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:41,774 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4659 mSDsluCounter, 12253 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 16371 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:41,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 16371 Invalid, 1046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [79 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:22:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-10-11 04:22:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2936. [2024-10-11 04:22:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.8004934790271414) internal successors, (5108), 2844 states have internal predecessors, (5108), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:22:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5261 transitions. [2024-10-11 04:22:41,900 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5261 transitions. Word has length 102 [2024-10-11 04:22:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:41,901 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5261 transitions. [2024-10-11 04:22:41,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5261 transitions. [2024-10-11 04:22:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:41,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:41,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:41,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:22:41,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -320973003, now seen corresponding path program 1 times [2024-10-11 04:22:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747397097] [2024-10-11 04:22:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:41,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:42,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:42,135 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-11 04:22:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:42,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747397097] [2024-10-11 04:22:42,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747397097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:42,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:42,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99886253] [2024-10-11 04:22:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:42,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:42,142 INFO L87 Difference]: Start difference. First operand 2936 states and 5261 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:43,187 INFO L93 Difference]: Finished difference Result 4005 states and 7019 transitions. [2024-10-11 04:22:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:43,203 INFO L225 Difference]: With dead ends: 4005 [2024-10-11 04:22:43,203 INFO L226 Difference]: Without dead ends: 3202 [2024-10-11 04:22:43,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:43,212 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4571 mSDsluCounter, 16316 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 20434 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:43,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 20434 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:22:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2024-10-11 04:22:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2936. [2024-10-11 04:22:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.798731053930208) internal successors, (5103), 2844 states have internal predecessors, (5103), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:22:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5256 transitions. [2024-10-11 04:22:43,321 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5256 transitions. Word has length 102 [2024-10-11 04:22:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:43,321 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5256 transitions. [2024-10-11 04:22:43,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5256 transitions. [2024-10-11 04:22:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:43,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:43,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:43,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:22:43,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:43,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1003883191, now seen corresponding path program 1 times [2024-10-11 04:22:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592561996] [2024-10-11 04:22:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:43,518 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-11 04:22:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592561996] [2024-10-11 04:22:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592561996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586904199] [2024-10-11 04:22:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:43,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:43,523 INFO L87 Difference]: Start difference. First operand 2936 states and 5256 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:44,554 INFO L93 Difference]: Finished difference Result 4000 states and 6996 transitions. [2024-10-11 04:22:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:22:44,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:44,570 INFO L225 Difference]: With dead ends: 4000 [2024-10-11 04:22:44,571 INFO L226 Difference]: Without dead ends: 3197 [2024-10-11 04:22:44,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:22:44,578 INFO L432 NwaCegarLoop]: 4118 mSDtfsCounter, 4569 mSDsluCounter, 16316 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4583 SdHoareTripleChecker+Valid, 20434 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:44,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4583 Valid, 20434 Invalid, 1101 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:22:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2024-10-11 04:22:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2936. [2024-10-11 04:22:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2837 states have (on average 1.7969686288332747) internal successors, (5098), 2844 states have internal predecessors, (5098), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:22:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 5251 transitions. [2024-10-11 04:22:44,703 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 5251 transitions. Word has length 102 [2024-10-11 04:22:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:44,704 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 5251 transitions. [2024-10-11 04:22:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 5251 transitions. [2024-10-11 04:22:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:44,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:44,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:44,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:22:44,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:44,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1724326155, now seen corresponding path program 1 times [2024-10-11 04:22:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:44,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628716671] [2024-10-11 04:22:44,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:44,890 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-11 04:22:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:44,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628716671] [2024-10-11 04:22:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628716671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776294912] [2024-10-11 04:22:44,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:44,893 INFO L87 Difference]: Start difference. First operand 2936 states and 5251 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:46,903 INFO L93 Difference]: Finished difference Result 4993 states and 8567 transitions. [2024-10-11 04:22:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:22:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:46,923 INFO L225 Difference]: With dead ends: 4993 [2024-10-11 04:22:46,923 INFO L226 Difference]: Without dead ends: 4192 [2024-10-11 04:22:46,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:22:46,929 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 4748 mSDsluCounter, 16816 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 21075 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:46,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 21075 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:22:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2024-10-11 04:22:47,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 3723. [2024-10-11 04:22:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3536 states have (on average 1.7531108597285068) internal successors, (6199), 3547 states have internal predecessors, (6199), 129 states have call successors, (129), 49 states have call predecessors, (129), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-11 04:22:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 6498 transitions. [2024-10-11 04:22:47,078 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 6498 transitions. Word has length 102 [2024-10-11 04:22:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:47,078 INFO L471 AbstractCegarLoop]: Abstraction has 3723 states and 6498 transitions. [2024-10-11 04:22:47,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 6498 transitions. [2024-10-11 04:22:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:47,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:47,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:47,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:22:47,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:47,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1512803063, now seen corresponding path program 1 times [2024-10-11 04:22:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164810530] [2024-10-11 04:22:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:47,260 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-11 04:22:47,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:47,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164810530] [2024-10-11 04:22:47,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164810530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:47,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:47,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647772902] [2024-10-11 04:22:47,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:47,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:47,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:47,262 INFO L87 Difference]: Start difference. First operand 3723 states and 6498 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:49,368 INFO L93 Difference]: Finished difference Result 8412 states and 14052 transitions. [2024-10-11 04:22:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:49,417 INFO L225 Difference]: With dead ends: 8412 [2024-10-11 04:22:49,418 INFO L226 Difference]: Without dead ends: 6824 [2024-10-11 04:22:49,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:49,427 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4978 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4998 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:49,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4998 Valid, 21068 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:22:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2024-10-11 04:22:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 5288. [2024-10-11 04:22:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 4933 states have (on average 1.7034259071558888) internal successors, (8403), 4952 states have internal predecessors, (8403), 241 states have call successors, (241), 97 states have call predecessors, (241), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-11 04:22:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 8996 transitions. [2024-10-11 04:22:49,812 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 8996 transitions. Word has length 102 [2024-10-11 04:22:49,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:49,813 INFO L471 AbstractCegarLoop]: Abstraction has 5288 states and 8996 transitions. [2024-10-11 04:22:49,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8996 transitions. [2024-10-11 04:22:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:49,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:49,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:49,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:22:49,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash 370300597, now seen corresponding path program 1 times [2024-10-11 04:22:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:49,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330605707] [2024-10-11 04:22:49,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:50,053 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-11 04:22:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330605707] [2024-10-11 04:22:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330605707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518239943] [2024-10-11 04:22:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:50,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:50,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:50,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:50,055 INFO L87 Difference]: Start difference. First operand 5288 states and 8996 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:52,542 INFO L93 Difference]: Finished difference Result 14195 states and 23402 transitions. [2024-10-11 04:22:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:52,585 INFO L225 Difference]: With dead ends: 14195 [2024-10-11 04:22:52,586 INFO L226 Difference]: Without dead ends: 11042 [2024-10-11 04:22:52,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:52,604 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4921 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4941 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:52,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4941 Valid, 21068 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:22:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11042 states. [2024-10-11 04:22:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11042 to 8433. [2024-10-11 04:22:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8433 states, 7750 states have (on average 1.6589677419354838) internal successors, (12857), 7785 states have internal predecessors, (12857), 457 states have call successors, (457), 193 states have call predecessors, (457), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-11 04:22:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8433 states to 8433 states and 14076 transitions. [2024-10-11 04:22:53,179 INFO L78 Accepts]: Start accepts. Automaton has 8433 states and 14076 transitions. Word has length 102 [2024-10-11 04:22:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:53,179 INFO L471 AbstractCegarLoop]: Abstraction has 8433 states and 14076 transitions. [2024-10-11 04:22:53,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8433 states and 14076 transitions. [2024-10-11 04:22:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:53,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:53,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:22:53,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1209334259, now seen corresponding path program 1 times [2024-10-11 04:22:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33797853] [2024-10-11 04:22:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:53,346 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-11 04:22:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33797853] [2024-10-11 04:22:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33797853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728478706] [2024-10-11 04:22:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:53,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:53,349 INFO L87 Difference]: Start difference. First operand 8433 states and 14076 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:22:55,635 INFO L93 Difference]: Finished difference Result 25710 states and 42196 transitions. [2024-10-11 04:22:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:22:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:22:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:22:55,719 INFO L225 Difference]: With dead ends: 25710 [2024-10-11 04:22:55,720 INFO L226 Difference]: Without dead ends: 19412 [2024-10-11 04:22:55,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:22:55,748 INFO L432 NwaCegarLoop]: 4226 mSDtfsCounter, 4898 mSDsluCounter, 16762 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 20988 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:22:55,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 20988 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:22:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2024-10-11 04:22:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 14723. [2024-10-11 04:22:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14723 states, 13400 states have (on average 1.6266417910447761) internal successors, (21797), 13467 states have internal predecessors, (21797), 873 states have call successors, (873), 385 states have call predecessors, (873), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-11 04:22:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14723 states to 14723 states and 24398 transitions. [2024-10-11 04:22:56,544 INFO L78 Accepts]: Start accepts. Automaton has 14723 states and 24398 transitions. Word has length 102 [2024-10-11 04:22:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:22:56,545 INFO L471 AbstractCegarLoop]: Abstraction has 14723 states and 24398 transitions. [2024-10-11 04:22:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:22:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14723 states and 24398 transitions. [2024-10-11 04:22:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:22:56,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:56,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:56,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:22:56,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1236399861, now seen corresponding path program 1 times [2024-10-11 04:22:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:56,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000485550] [2024-10-11 04:22:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:22:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:22:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:22:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:22:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:56,718 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-11 04:22:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000485550] [2024-10-11 04:22:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000485550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:56,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:56,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:22:56,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984012079] [2024-10-11 04:22:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:56,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:22:56,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:22:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:22:56,720 INFO L87 Difference]: Start difference. First operand 14723 states and 24398 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:00,461 INFO L93 Difference]: Finished difference Result 48260 states and 79600 transitions. [2024-10-11 04:23:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:23:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:00,614 INFO L225 Difference]: With dead ends: 48260 [2024-10-11 04:23:00,614 INFO L226 Difference]: Without dead ends: 35672 [2024-10-11 04:23:00,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:00,668 INFO L432 NwaCegarLoop]: 4258 mSDtfsCounter, 4789 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2191 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4801 SdHoareTripleChecker+Valid, 21069 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:00,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4801 Valid, 21069 Invalid, 2253 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 2191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:23:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35672 states. [2024-10-11 04:23:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35672 to 27303. [2024-10-11 04:23:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27303 states, 24732 states have (on average 1.6068655992236778) internal successors, (39741), 24863 states have internal predecessors, (39741), 1673 states have call successors, (1673), 769 states have call predecessors, (1673), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-11 04:23:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27303 states to 27303 states and 45528 transitions. [2024-10-11 04:23:02,428 INFO L78 Accepts]: Start accepts. Automaton has 27303 states and 45528 transitions. Word has length 102 [2024-10-11 04:23:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:02,429 INFO L471 AbstractCegarLoop]: Abstraction has 27303 states and 45528 transitions. [2024-10-11 04:23:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 27303 states and 45528 transitions. [2024-10-11 04:23:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:23:02,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:02,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:02,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:23:02,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:02,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -840937037, now seen corresponding path program 1 times [2024-10-11 04:23:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:02,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523338861] [2024-10-11 04:23:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:23:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:23:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:23:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:23:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523338861] [2024-10-11 04:23:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523338861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791358137] [2024-10-11 04:23:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:02,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:02,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:02,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:02,607 INFO L87 Difference]: Start difference. First operand 27303 states and 45528 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:08,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:08,016 INFO L93 Difference]: Finished difference Result 92400 states and 154688 transitions. [2024-10-11 04:23:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:23:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:08,385 INFO L225 Difference]: With dead ends: 92400 [2024-10-11 04:23:08,386 INFO L226 Difference]: Without dead ends: 67232 [2024-10-11 04:23:08,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:08,483 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 4819 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 1980 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 21070 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:08,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4839 Valid, 21070 Invalid, 2043 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 1980 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:23:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67232 states. [2024-10-11 04:23:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67232 to 52463. [2024-10-11 04:23:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52463 states, 47460 states have (on average 1.596228402865571) internal successors, (75757), 47719 states have internal predecessors, (75757), 3209 states have call successors, (3209), 1537 states have call predecessors, (3209), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-11 04:23:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52463 states to 52463 states and 89246 transitions. [2024-10-11 04:23:12,103 INFO L78 Accepts]: Start accepts. Automaton has 52463 states and 89246 transitions. Word has length 102 [2024-10-11 04:23:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:12,103 INFO L471 AbstractCegarLoop]: Abstraction has 52463 states and 89246 transitions. [2024-10-11 04:23:12,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 52463 states and 89246 transitions. [2024-10-11 04:23:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:23:12,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:12,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:12,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:23:12,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:12,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash 893167413, now seen corresponding path program 1 times [2024-10-11 04:23:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:12,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735459814] [2024-10-11 04:23:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:23:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:23:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:23:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:23:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,293 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-11 04:23:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735459814] [2024-10-11 04:23:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735459814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798716935] [2024-10-11 04:23:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:12,295 INFO L87 Difference]: Start difference. First operand 52463 states and 89246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:23:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:22,293 INFO L93 Difference]: Finished difference Result 178760 states and 307368 transitions. [2024-10-11 04:23:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-11 04:23:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:23,229 INFO L225 Difference]: With dead ends: 178760 [2024-10-11 04:23:23,229 INFO L226 Difference]: Without dead ends: 128432 [2024-10-11 04:23:23,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:23,560 INFO L432 NwaCegarLoop]: 4257 mSDtfsCounter, 4770 mSDsluCounter, 16811 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 21068 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:23,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 21068 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:23:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128432 states. [2024-10-11 04:23:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128432 to 102783. [2024-10-11 04:23:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102783 states, 93044 states have (on average 1.5911289282490004) internal successors, (148045), 93559 states have internal predecessors, (148045), 6153 states have call successors, (6153), 3073 states have call predecessors, (6153), 3584 states have return successors, (26858), 6662 states have call predecessors, (26858), 6151 states have call successors, (26858)