./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6cc7ef7e5cfcea54541e5555a1065ebb68875de99e452e2755d94724a415589e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6cc7ef7e5cfcea54541e5555a1065ebb68875de99e452e2755d94724a415589e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:10:38,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:10:38,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:10:38,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:10:38,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:10:38,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:10:38,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:10:38,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:10:38,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:10:38,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:10:38,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:10:38,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:10:38,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:10:38,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:10:38,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:10:38,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:10:38,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:10:38,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:10:38,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:10:38,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:10:38,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:10:38,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:10:38,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:10:38,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:10:38,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:10:38,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:10:38,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:10:38,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:10:38,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:10:38,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:10:38,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:10:38,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:10:38,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:10:38,405 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 6cc7ef7e5cfcea54541e5555a1065ebb68875de99e452e2755d94724a415589e [2024-11-07 00:10:38,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:10:38,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:10:38,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:10:38,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:10:38,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:10:38,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-11-07 00:10:40,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:10:40,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:10:40,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-11-07 00:10:40,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc3d00c7d/b200f38d0e484f868826b789996c1e30/FLAG88cd04e4d [2024-11-07 00:10:40,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc3d00c7d/b200f38d0e484f868826b789996c1e30 [2024-11-07 00:10:40,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:10:40,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:10:40,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:10:40,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:10:40,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:10:40,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:10:40" (1/1) ... [2024-11-07 00:10:40,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a430355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:40, skipping insertion in model container [2024-11-07 00:10:40,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:10:40" (1/1) ... [2024-11-07 00:10:40,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:10:41,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c[65471,65484] [2024-11-07 00:10:41,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:10:41,226 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:10:41,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c[65471,65484] [2024-11-07 00:10:41,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:10:41,395 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:10:41,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41 WrapperNode [2024-11-07 00:10:41,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:10:41,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:10:41,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:10:41,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:10:41,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,523 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2140 [2024-11-07 00:10:41,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:10:41,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:10:41,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:10:41,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:10:41,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:10:41,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:10:41,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:10:41,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:10:41,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:10:41,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (1/1) ... [2024-11-07 00:10:41,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:10:41,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:10:41,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:10:41,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:10:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:10:41,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:10:41,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:10:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:10:41,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:10:41,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:10:44,316 INFO L? ?]: Removed 240 outVars from TransFormulas that were not future-live. [2024-11-07 00:10:44,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:10:44,350 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:10:44,350 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:10:44,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:10:44 BoogieIcfgContainer [2024-11-07 00:10:44,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:10:44,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:10:44,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:10:44,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:10:44,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:10:40" (1/3) ... [2024-11-07 00:10:44,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a790072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:10:44, skipping insertion in model container [2024-11-07 00:10:44,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:10:41" (2/3) ... [2024-11-07 00:10:44,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a790072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:10:44, skipping insertion in model container [2024-11-07 00:10:44,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:10:44" (3/3) ... [2024-11-07 00:10:44,362 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c [2024-11-07 00:10:44,381 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:10:44,381 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:10:44,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:10:44,481 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;@28d62691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:10:44,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:10:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.8703170028818443) internal successors, (1298), 695 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 00:10:44,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:44,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:44,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:44,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 46633421, now seen corresponding path program 1 times [2024-11-07 00:10:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333372951] [2024-11-07 00:10:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:45,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333372951] [2024-11-07 00:10:45,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333372951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:45,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:45,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:10:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275701439] [2024-11-07 00:10:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:45,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:10:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:10:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:10:45,412 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.8703170028818443) internal successors, (1298), 695 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:45,487 INFO L93 Difference]: Finished difference Result 842 states and 1560 transitions. [2024-11-07 00:10:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:10:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-07 00:10:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:45,519 INFO L225 Difference]: With dead ends: 842 [2024-11-07 00:10:45,520 INFO L226 Difference]: Without dead ends: 692 [2024-11-07 00:10:45,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:10:45,528 INFO L432 NwaCegarLoop]: 1295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:45,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-07 00:10:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-11-07 00:10:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.8683068017366136) internal successors, (1291), 691 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1291 transitions. [2024-11-07 00:10:45,642 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1291 transitions. Word has length 153 [2024-11-07 00:10:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:45,645 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1291 transitions. [2024-11-07 00:10:45,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1291 transitions. [2024-11-07 00:10:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 00:10:45,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:45,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:45,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:10:45,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:45,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash -462839669, now seen corresponding path program 1 times [2024-11-07 00:10:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:45,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148103659] [2024-11-07 00:10:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148103659] [2024-11-07 00:10:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148103659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:46,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:46,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:10:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802893046] [2024-11-07 00:10:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:46,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:10:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:10:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:46,529 INFO L87 Difference]: Start difference. First operand 692 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:46,687 INFO L93 Difference]: Finished difference Result 837 states and 1550 transitions. [2024-11-07 00:10:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:10:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-07 00:10:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:46,692 INFO L225 Difference]: With dead ends: 837 [2024-11-07 00:10:46,693 INFO L226 Difference]: Without dead ends: 692 [2024-11-07 00:10:46,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:46,695 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 0 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:46,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5086 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-07 00:10:46,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-11-07 00:10:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 1.7742402315484804) internal successors, (1226), 691 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1226 transitions. [2024-11-07 00:10:46,733 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1226 transitions. Word has length 153 [2024-11-07 00:10:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:46,735 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1226 transitions. [2024-11-07 00:10:46,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1226 transitions. [2024-11-07 00:10:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 00:10:46,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:46,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:46,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:10:46,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2032916201, now seen corresponding path program 1 times [2024-11-07 00:10:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:46,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294199795] [2024-11-07 00:10:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294199795] [2024-11-07 00:10:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294199795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193528218] [2024-11-07 00:10:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:47,239 INFO L87 Difference]: Start difference. First operand 692 states and 1226 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:47,326 INFO L93 Difference]: Finished difference Result 960 states and 1710 transitions. [2024-11-07 00:10:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-11-07 00:10:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:47,333 INFO L225 Difference]: With dead ends: 960 [2024-11-07 00:10:47,334 INFO L226 Difference]: Without dead ends: 819 [2024-11-07 00:10:47,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:47,341 INFO L432 NwaCegarLoop]: 1225 mSDtfsCounter, 221 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:47,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2382 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-11-07 00:10:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2024-11-07 00:10:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.775735294117647) internal successors, (1449), 816 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1449 transitions. [2024-11-07 00:10:47,372 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1449 transitions. Word has length 217 [2024-11-07 00:10:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:47,373 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1449 transitions. [2024-11-07 00:10:47,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1449 transitions. [2024-11-07 00:10:47,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-07 00:10:47,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:47,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:10:47,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:47,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1022770877, now seen corresponding path program 1 times [2024-11-07 00:10:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172619544] [2024-11-07 00:10:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:47,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172619544] [2024-11-07 00:10:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172619544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:47,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:47,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976090558] [2024-11-07 00:10:47,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:47,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:47,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:47,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:47,781 INFO L87 Difference]: Start difference. First operand 817 states and 1449 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:47,838 INFO L93 Difference]: Finished difference Result 1325 states and 2361 transitions. [2024-11-07 00:10:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-11-07 00:10:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:47,845 INFO L225 Difference]: With dead ends: 1325 [2024-11-07 00:10:47,845 INFO L226 Difference]: Without dead ends: 1059 [2024-11-07 00:10:47,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:47,848 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 221 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:47,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 2390 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-07 00:10:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1057. [2024-11-07 00:10:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 1.7803030303030303) internal successors, (1880), 1056 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1880 transitions. [2024-11-07 00:10:47,885 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1880 transitions. Word has length 221 [2024-11-07 00:10:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1880 transitions. [2024-11-07 00:10:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:47,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1880 transitions. [2024-11-07 00:10:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 00:10:47,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:47,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:47,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:10:47,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:47,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1113466973, now seen corresponding path program 1 times [2024-11-07 00:10:47,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:47,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226261432] [2024-11-07 00:10:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:47,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226261432] [2024-11-07 00:10:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226261432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796456956] [2024-11-07 00:10:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:48,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:48,282 INFO L87 Difference]: Start difference. First operand 1057 states and 1880 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:48,341 INFO L93 Difference]: Finished difference Result 2021 states and 3610 transitions. [2024-11-07 00:10:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-07 00:10:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:48,350 INFO L225 Difference]: With dead ends: 2021 [2024-11-07 00:10:48,350 INFO L226 Difference]: Without dead ends: 1515 [2024-11-07 00:10:48,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:48,353 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 213 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:48,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2391 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-11-07 00:10:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2024-11-07 00:10:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1512 states have (on average 1.783068783068783) internal successors, (2696), 1512 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2696 transitions. [2024-11-07 00:10:48,412 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2696 transitions. Word has length 225 [2024-11-07 00:10:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:48,413 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2696 transitions. [2024-11-07 00:10:48,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2696 transitions. [2024-11-07 00:10:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-07 00:10:48,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:48,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:10:48,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1539339209, now seen corresponding path program 1 times [2024-11-07 00:10:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922276624] [2024-11-07 00:10:48,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922276624] [2024-11-07 00:10:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922276624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323579867] [2024-11-07 00:10:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:48,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:48,749 INFO L87 Difference]: Start difference. First operand 1513 states and 2696 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:48,815 INFO L93 Difference]: Finished difference Result 3341 states and 5970 transitions. [2024-11-07 00:10:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-07 00:10:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:48,828 INFO L225 Difference]: With dead ends: 3341 [2024-11-07 00:10:48,828 INFO L226 Difference]: Without dead ends: 2379 [2024-11-07 00:10:48,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:48,832 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 205 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:48,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 2392 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2024-11-07 00:10:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2024-11-07 00:10:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 2376 states have (on average 1.7828282828282829) internal successors, (4236), 2376 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 4236 transitions. [2024-11-07 00:10:48,908 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 4236 transitions. Word has length 229 [2024-11-07 00:10:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:48,909 INFO L471 AbstractCegarLoop]: Abstraction has 2377 states and 4236 transitions. [2024-11-07 00:10:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 4236 transitions. [2024-11-07 00:10:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 00:10:48,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:48,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:48,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:10:48,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:48,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1794403537, now seen corresponding path program 1 times [2024-11-07 00:10:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135678206] [2024-11-07 00:10:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:48,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:49,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:49,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135678206] [2024-11-07 00:10:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135678206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:49,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784182383] [2024-11-07 00:10:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:49,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:49,237 INFO L87 Difference]: Start difference. First operand 2377 states and 4236 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:49,319 INFO L93 Difference]: Finished difference Result 5837 states and 10414 transitions. [2024-11-07 00:10:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:49,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-11-07 00:10:49,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:49,341 INFO L225 Difference]: With dead ends: 5837 [2024-11-07 00:10:49,341 INFO L226 Difference]: Without dead ends: 4011 [2024-11-07 00:10:49,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:49,347 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 197 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:49,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2393 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2024-11-07 00:10:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4009. [2024-11-07 00:10:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 4008 states have (on average 1.7794411177644711) internal successors, (7132), 4008 states have internal predecessors, (7132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 7132 transitions. [2024-11-07 00:10:49,490 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 7132 transitions. Word has length 233 [2024-11-07 00:10:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:49,491 INFO L471 AbstractCegarLoop]: Abstraction has 4009 states and 7132 transitions. [2024-11-07 00:10:49,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 7132 transitions. [2024-11-07 00:10:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 00:10:49,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:49,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:49,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:10:49,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:49,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1913435605, now seen corresponding path program 1 times [2024-11-07 00:10:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:49,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96875618] [2024-11-07 00:10:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:50,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96875618] [2024-11-07 00:10:50,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96875618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:50,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:50,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:10:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677921477] [2024-11-07 00:10:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:50,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:10:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:50,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:10:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:10:50,121 INFO L87 Difference]: Start difference. First operand 4009 states and 7132 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:50,934 INFO L93 Difference]: Finished difference Result 23805 states and 42646 transitions. [2024-11-07 00:10:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 00:10:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-11-07 00:10:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:51,046 INFO L225 Difference]: With dead ends: 23805 [2024-11-07 00:10:51,047 INFO L226 Difference]: Without dead ends: 20347 [2024-11-07 00:10:51,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:10:51,067 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 2628 mSDsluCounter, 10211 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 11432 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:51,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 11432 Invalid, 356 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:10:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20347 states. [2024-11-07 00:10:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20347 to 7328. [2024-11-07 00:10:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7328 states, 7327 states have (on average 1.7794458850825714) internal successors, (13038), 7327 states have internal predecessors, (13038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 13038 transitions. [2024-11-07 00:10:51,652 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 13038 transitions. Word has length 237 [2024-11-07 00:10:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:51,652 INFO L471 AbstractCegarLoop]: Abstraction has 7328 states and 13038 transitions. [2024-11-07 00:10:51,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 13038 transitions. [2024-11-07 00:10:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-07 00:10:51,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:51,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:51,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:10:51,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:51,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1453341025, now seen corresponding path program 1 times [2024-11-07 00:10:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4909121] [2024-11-07 00:10:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4909121] [2024-11-07 00:10:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4909121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:10:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070057032] [2024-11-07 00:10:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:52,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:10:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:10:52,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:10:52,047 INFO L87 Difference]: Start difference. First operand 7328 states and 13038 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:52,314 INFO L93 Difference]: Finished difference Result 21287 states and 38031 transitions. [2024-11-07 00:10:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:10:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-11-07 00:10:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:52,374 INFO L225 Difference]: With dead ends: 21287 [2024-11-07 00:10:52,374 INFO L226 Difference]: Without dead ends: 14510 [2024-11-07 00:10:52,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:52,394 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 736 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 3846 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:52,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 3846 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14510 states. [2024-11-07 00:10:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14510 to 10886. [2024-11-07 00:10:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10886 states, 10885 states have (on average 1.780064308681672) internal successors, (19376), 10885 states have internal predecessors, (19376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10886 states to 10886 states and 19376 transitions. [2024-11-07 00:10:52,827 INFO L78 Accepts]: Start accepts. Automaton has 10886 states and 19376 transitions. Word has length 238 [2024-11-07 00:10:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 10886 states and 19376 transitions. [2024-11-07 00:10:52,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 10886 states and 19376 transitions. [2024-11-07 00:10:52,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:10:52,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:52,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:10:52,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:52,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1866481297, now seen corresponding path program 1 times [2024-11-07 00:10:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208693571] [2024-11-07 00:10:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208693571] [2024-11-07 00:10:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208693571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651466278] [2024-11-07 00:10:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:53,197 INFO L87 Difference]: Start difference. First operand 10886 states and 19376 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:53,551 INFO L93 Difference]: Finished difference Result 24013 states and 42846 transitions. [2024-11-07 00:10:53,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:10:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:53,600 INFO L225 Difference]: With dead ends: 24013 [2024-11-07 00:10:53,600 INFO L226 Difference]: Without dead ends: 16773 [2024-11-07 00:10:53,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:53,619 INFO L432 NwaCegarLoop]: 1427 mSDtfsCounter, 230 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:53,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 2615 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16773 states. [2024-11-07 00:10:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16773 to 16771. [2024-11-07 00:10:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16771 states, 16770 states have (on average 1.7762075134168158) internal successors, (29787), 16770 states have internal predecessors, (29787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16771 states to 16771 states and 29787 transitions. [2024-11-07 00:10:54,085 INFO L78 Accepts]: Start accepts. Automaton has 16771 states and 29787 transitions. Word has length 239 [2024-11-07 00:10:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:54,086 INFO L471 AbstractCegarLoop]: Abstraction has 16771 states and 29787 transitions. [2024-11-07 00:10:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 16771 states and 29787 transitions. [2024-11-07 00:10:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:10:54,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:54,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:54,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:10:54,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1951768689, now seen corresponding path program 1 times [2024-11-07 00:10:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:54,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258882418] [2024-11-07 00:10:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:54,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258882418] [2024-11-07 00:10:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258882418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:54,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246587122] [2024-11-07 00:10:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:54,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:54,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:54,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:54,420 INFO L87 Difference]: Start difference. First operand 16771 states and 29787 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:54,700 INFO L93 Difference]: Finished difference Result 32435 states and 57586 transitions. [2024-11-07 00:10:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:10:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:54,775 INFO L225 Difference]: With dead ends: 32435 [2024-11-07 00:10:54,775 INFO L226 Difference]: Without dead ends: 23729 [2024-11-07 00:10:54,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:54,802 INFO L432 NwaCegarLoop]: 1416 mSDtfsCounter, 222 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:54,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 2605 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23729 states. [2024-11-07 00:10:55,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23729 to 23727. [2024-11-07 00:10:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23727 states, 23726 states have (on average 1.7691561999494225) internal successors, (41975), 23726 states have internal predecessors, (41975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23727 states to 23727 states and 41975 transitions. [2024-11-07 00:10:55,493 INFO L78 Accepts]: Start accepts. Automaton has 23727 states and 41975 transitions. Word has length 239 [2024-11-07 00:10:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 23727 states and 41975 transitions. [2024-11-07 00:10:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 23727 states and 41975 transitions. [2024-11-07 00:10:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:10:55,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:55,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:10:55,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:55,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash 844816977, now seen corresponding path program 1 times [2024-11-07 00:10:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:55,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632304075] [2024-11-07 00:10:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:55,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:55,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632304075] [2024-11-07 00:10:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632304075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:55,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351130432] [2024-11-07 00:10:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:55,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:55,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:55,858 INFO L87 Difference]: Start difference. First operand 23727 states and 41975 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:56,255 INFO L93 Difference]: Finished difference Result 45935 states and 81222 transitions. [2024-11-07 00:10:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:10:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:56,357 INFO L225 Difference]: With dead ends: 45935 [2024-11-07 00:10:56,357 INFO L226 Difference]: Without dead ends: 33517 [2024-11-07 00:10:56,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:56,391 INFO L432 NwaCegarLoop]: 1396 mSDtfsCounter, 214 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 2586 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:56,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 2586 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33517 states. [2024-11-07 00:10:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33517 to 33515. [2024-11-07 00:10:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33515 states, 33514 states have (on average 1.761263949394283) internal successors, (59027), 33514 states have internal predecessors, (59027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33515 states to 33515 states and 59027 transitions. [2024-11-07 00:10:57,466 INFO L78 Accepts]: Start accepts. Automaton has 33515 states and 59027 transitions. Word has length 239 [2024-11-07 00:10:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:57,466 INFO L471 AbstractCegarLoop]: Abstraction has 33515 states and 59027 transitions. [2024-11-07 00:10:57,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 33515 states and 59027 transitions. [2024-11-07 00:10:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:10:57,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:57,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:57,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:10:57,471 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:57,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 120587313, now seen corresponding path program 1 times [2024-11-07 00:10:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:57,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015141552] [2024-11-07 00:10:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:10:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:57,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015141552] [2024-11-07 00:10:57,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015141552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:57,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:57,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:10:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283752732] [2024-11-07 00:10:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:57,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:10:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:10:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:57,789 INFO L87 Difference]: Start difference. First operand 33515 states and 59027 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:58,386 INFO L93 Difference]: Finished difference Result 64899 states and 114226 transitions. [2024-11-07 00:10:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:10:58,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:10:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:58,554 INFO L225 Difference]: With dead ends: 64899 [2024-11-07 00:10:58,555 INFO L226 Difference]: Without dead ends: 47233 [2024-11-07 00:10:58,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:10:58,607 INFO L432 NwaCegarLoop]: 1376 mSDtfsCounter, 206 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:58,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 2567 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47233 states. [2024-11-07 00:10:59,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47233 to 47231. [2024-11-07 00:10:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47231 states, 47230 states have (on average 1.7523819606182511) internal successors, (82765), 47230 states have internal predecessors, (82765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47231 states to 47231 states and 82765 transitions. [2024-11-07 00:10:59,962 INFO L78 Accepts]: Start accepts. Automaton has 47231 states and 82765 transitions. Word has length 239 [2024-11-07 00:10:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 47231 states and 82765 transitions. [2024-11-07 00:10:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:10:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 47231 states and 82765 transitions. [2024-11-07 00:10:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:10:59,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:59,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:10:59,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:10:59,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 817169937, now seen corresponding path program 1 times [2024-11-07 00:10:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292669808] [2024-11-07 00:10:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:11:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:11:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:11:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:11:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292669808] [2024-11-07 00:11:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292669808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:11:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:11:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:11:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848456102] [2024-11-07 00:11:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:11:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:11:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:11:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:11:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:11:00,346 INFO L87 Difference]: Start difference. First operand 47231 states and 82765 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:11:01,088 INFO L93 Difference]: Finished difference Result 91419 states and 160062 transitions. [2024-11-07 00:11:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:11:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:11:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:11:01,312 INFO L225 Difference]: With dead ends: 91419 [2024-11-07 00:11:01,313 INFO L226 Difference]: Without dead ends: 66361 [2024-11-07 00:11:01,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:11:01,369 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 198 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:11:01,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 2548 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:11:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66361 states. [2024-11-07 00:11:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66361 to 66359. [2024-11-07 00:11:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66359 states, 66358 states have (on average 1.7423219506314236) internal successors, (115617), 66358 states have internal predecessors, (115617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66359 states to 66359 states and 115617 transitions. [2024-11-07 00:11:02,917 INFO L78 Accepts]: Start accepts. Automaton has 66359 states and 115617 transitions. Word has length 239 [2024-11-07 00:11:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:11:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 66359 states and 115617 transitions. [2024-11-07 00:11:02,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 66359 states and 115617 transitions. [2024-11-07 00:11:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 00:11:02,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:11:02,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:11:02,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:11:02,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:11:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:11:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 93693410, now seen corresponding path program 1 times [2024-11-07 00:11:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:11:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969122433] [2024-11-07 00:11:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:11:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:11:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:11:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:11:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:11:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969122433] [2024-11-07 00:11:03,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969122433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:11:03,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:11:03,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:11:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730662741] [2024-11-07 00:11:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:11:03,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:11:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:11:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:11:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:11:03,494 INFO L87 Difference]: Start difference. First operand 66359 states and 115617 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:11:05,298 INFO L93 Difference]: Finished difference Result 219525 states and 382555 transitions. [2024-11-07 00:11:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:11:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2024-11-07 00:11:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:11:05,720 INFO L225 Difference]: With dead ends: 219525 [2024-11-07 00:11:05,721 INFO L226 Difference]: Without dead ends: 153767 [2024-11-07 00:11:05,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:11:05,810 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 734 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:11:05,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 3843 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:11:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153767 states. [2024-11-07 00:11:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153767 to 109794. [2024-11-07 00:11:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109794 states, 109793 states have (on average 1.734791835545071) internal successors, (190468), 109793 states have internal predecessors, (190468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109794 states to 109794 states and 190468 transitions. [2024-11-07 00:11:08,458 INFO L78 Accepts]: Start accepts. Automaton has 109794 states and 190468 transitions. Word has length 239 [2024-11-07 00:11:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:11:08,459 INFO L471 AbstractCegarLoop]: Abstraction has 109794 states and 190468 transitions. [2024-11-07 00:11:08,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109794 states and 190468 transitions. [2024-11-07 00:11:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-07 00:11:08,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:11:08,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:11:08,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:11:08,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:11:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:11:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 976124982, now seen corresponding path program 1 times [2024-11-07 00:11:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:11:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164792200] [2024-11-07 00:11:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:11:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:11:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:11:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:11:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:11:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164792200] [2024-11-07 00:11:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164792200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:11:09,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:11:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:11:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072531950] [2024-11-07 00:11:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:11:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:11:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:11:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:11:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:11:09,112 INFO L87 Difference]: Start difference. First operand 109794 states and 190468 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:11:11,238 INFO L93 Difference]: Finished difference Result 363279 states and 630349 transitions. [2024-11-07 00:11:11,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:11:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-11-07 00:11:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:11:11,928 INFO L225 Difference]: With dead ends: 363279 [2024-11-07 00:11:11,929 INFO L226 Difference]: Without dead ends: 254086 [2024-11-07 00:11:12,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:11:12,068 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 732 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:11:12,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 3841 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:11:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254086 states. [2024-11-07 00:11:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254086 to 181497. [2024-11-07 00:11:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181497 states, 181496 states have (on average 1.7272832459117555) internal successors, (313495), 181496 states have internal predecessors, (313495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181497 states to 181497 states and 313495 transitions. [2024-11-07 00:11:16,430 INFO L78 Accepts]: Start accepts. Automaton has 181497 states and 313495 transitions. Word has length 240 [2024-11-07 00:11:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:11:16,430 INFO L471 AbstractCegarLoop]: Abstraction has 181497 states and 313495 transitions. [2024-11-07 00:11:16,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 181497 states and 313495 transitions. [2024-11-07 00:11:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-07 00:11:16,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:11:16,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:11:16,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:11:16,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:11:16,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:11:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1564263015, now seen corresponding path program 1 times [2024-11-07 00:11:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:11:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933501988] [2024-11-07 00:11:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:11:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:11:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:11:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:11:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:11:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933501988] [2024-11-07 00:11:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933501988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:11:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:11:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:11:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133704239] [2024-11-07 00:11:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:11:17,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:11:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:11:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:11:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:11:17,105 INFO L87 Difference]: Start difference. First operand 181497 states and 313495 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:20,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:11:20,958 INFO L93 Difference]: Finished difference Result 598865 states and 1034687 transitions. [2024-11-07 00:11:20,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:11:20,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2024-11-07 00:11:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:11:21,955 INFO L225 Difference]: With dead ends: 598865 [2024-11-07 00:11:21,955 INFO L226 Difference]: Without dead ends: 417969 [2024-11-07 00:11:22,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:11:22,172 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 730 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3843 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:11:22,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3843 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:11:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417969 states. [2024-11-07 00:11:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417969 to 299008. [2024-11-07 00:11:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299008 states, 299007 states have (on average 1.719872778898153) internal successors, (514254), 299007 states have internal predecessors, (514254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299008 states to 299008 states and 514254 transitions. [2024-11-07 00:11:29,949 INFO L78 Accepts]: Start accepts. Automaton has 299008 states and 514254 transitions. Word has length 241 [2024-11-07 00:11:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:11:29,950 INFO L471 AbstractCegarLoop]: Abstraction has 299008 states and 514254 transitions. [2024-11-07 00:11:29,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:11:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 299008 states and 514254 transitions. [2024-11-07 00:11:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-07 00:11:29,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:11:29,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:11:29,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:11:29,952 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:11:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:11:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1457092045, now seen corresponding path program 1 times [2024-11-07 00:11:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:11:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251647944] [2024-11-07 00:11:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:11:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:11:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:11:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:11:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:11:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251647944] [2024-11-07 00:11:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251647944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:11:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:11:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:11:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346953355] [2024-11-07 00:11:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:11:30,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:11:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:11:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:11:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:11:30,288 INFO L87 Difference]: Start difference. First operand 299008 states and 514254 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)