./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.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.4.1.ufo.BOUNDED-8.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', '77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670'] 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.4.1.ufo.BOUNDED-8.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 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:09:32,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:09:32,614 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:09:32,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:09:32,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:09:32,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:09:32,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:09:32,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:09:32,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:09:32,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:09:32,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:09:32,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:09:32,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:09:32,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:09:32,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:09:32,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:09:32,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:09:32,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:09:32,664 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 -> 77af8780d2ec99ad0d03b475aa25db67a7ba0a218594f51cddbe35460cd2b670 [2024-11-07 00:09:32,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:09:32,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:09:33,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:09:33,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:09:33,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:09:33,004 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.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:09:34,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:09:34,723 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:09:34,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:09:34,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ae576d63/394e0d751a7342ada52d9d15f7ac921e/FLAG44ba71723 [2024-11-07 00:09:34,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ae576d63/394e0d751a7342ada52d9d15f7ac921e [2024-11-07 00:09:34,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:09:34,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:09:34,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:09:34,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:09:34,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:09:34,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:34" (1/1) ... [2024-11-07 00:09:34,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9eaea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:34, skipping insertion in model container [2024-11-07 00:09:34,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:09:34" (1/1) ... [2024-11-07 00:09:34,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:09:35,102 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.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2024-11-07 00:09:35,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:09:35,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:09:35,198 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.4.1.ufo.BOUNDED-8.pals.c[26618,26631] [2024-11-07 00:09:35,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:09:35,216 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:09:35,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35 WrapperNode [2024-11-07 00:09:35,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:09:35,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:09:35,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:09:35,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:09:35,227 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:09:35" (1/1) ... [2024-11-07 00:09:35,242 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:09:35" (1/1) ... [2024-11-07 00:09:35,291 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 998 [2024-11-07 00:09:35,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:09:35,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:09:35,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:09:35,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:09:35,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,351 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:09:35,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:09:35,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:09:35,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:09:35,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:09:35,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (1/1) ... [2024-11-07 00:09:35,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:09:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:09:35,462 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:09:35,465 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:09:35,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:09:35,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:09:35,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:09:35,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:09:35,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:09:35,640 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:09:36,704 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-07 00:09:36,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:09:36,727 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:09:36,727 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:09:36,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:36 BoogieIcfgContainer [2024-11-07 00:09:36,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:09:36,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:09:36,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:09:36,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:09:36,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:09:34" (1/3) ... [2024-11-07 00:09:36,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfa959d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:36, skipping insertion in model container [2024-11-07 00:09:36,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:09:35" (2/3) ... [2024-11-07 00:09:36,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bfa959d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:09:36, skipping insertion in model container [2024-11-07 00:09:36,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:09:36" (3/3) ... [2024-11-07 00:09:36,743 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:09:36,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:09:36,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:09:36,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:09:36,833 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;@4661e36b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:09:36,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:09:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 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:09:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:09:36,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:36,859 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] [2024-11-07 00:09:36,860 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:36,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1232885452, now seen corresponding path program 1 times [2024-11-07 00:09:36,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300974185] [2024-11-07 00:09:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:37,413 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:09:37,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300974185] [2024-11-07 00:09:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300974185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:09:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311982058] [2024-11-07 00:09:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:37,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:09:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:09:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:09:37,446 INFO L87 Difference]: Start difference. First operand has 288 states, 286 states have (on average 1.8251748251748252) internal successors, (522), 287 states have internal predecessors, (522), 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 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:09:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:37,481 INFO L93 Difference]: Finished difference Result 393 states and 706 transitions. [2024-11-07 00:09:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:09:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2024-11-07 00:09:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:37,497 INFO L225 Difference]: With dead ends: 393 [2024-11-07 00:09:37,497 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:09:37,504 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:09:37,507 INFO L432 NwaCegarLoop]: 519 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, 519 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:09:37,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:09:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:09:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.8197879858657244) internal successors, (515), 283 states have internal predecessors, (515), 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:09:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 515 transitions. [2024-11-07 00:09:37,566 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 515 transitions. Word has length 77 [2024-11-07 00:09:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:37,568 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 515 transitions. [2024-11-07 00:09:37,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 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:09:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 515 transitions. [2024-11-07 00:09:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:09:37,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:37,574 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] [2024-11-07 00:09:37,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:09:37,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1098871946, now seen corresponding path program 1 times [2024-11-07 00:09:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412663349] [2024-11-07 00:09:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:38,187 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:09:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412663349] [2024-11-07 00:09:38,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412663349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:38,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:38,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:09:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644613833] [2024-11-07 00:09:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:09:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:09:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:09:38,194 INFO L87 Difference]: Start difference. First operand 284 states and 515 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:09:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:38,356 INFO L93 Difference]: Finished difference Result 388 states and 696 transitions. [2024-11-07 00:09:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:09:38,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:09:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:38,360 INFO L225 Difference]: With dead ends: 388 [2024-11-07 00:09:38,363 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 00:09:38,364 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:09:38,364 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:38,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2013 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 00:09:38,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-07 00:09:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.6996466431095407) internal successors, (481), 283 states have internal predecessors, (481), 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:09:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 481 transitions. [2024-11-07 00:09:38,380 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 481 transitions. Word has length 77 [2024-11-07 00:09:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:38,380 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 481 transitions. [2024-11-07 00:09:38,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:09:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 481 transitions. [2024-11-07 00:09:38,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 00:09:38,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:38,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] [2024-11-07 00:09:38,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:09:38,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:38,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash -313489098, now seen corresponding path program 1 times [2024-11-07 00:09:38,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:38,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541862604] [2024-11-07 00:09:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:38,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:38,713 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:09:38,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:38,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541862604] [2024-11-07 00:09:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541862604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:38,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913172737] [2024-11-07 00:09:38,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:38,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:38,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:38,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:38,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:38,717 INFO L87 Difference]: Start difference. First operand 284 states and 481 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:38,780 INFO L93 Difference]: Finished difference Result 472 states and 813 transitions. [2024-11-07 00:09:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 110 [2024-11-07 00:09:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:38,786 INFO L225 Difference]: With dead ends: 472 [2024-11-07 00:09:38,787 INFO L226 Difference]: Without dead ends: 372 [2024-11-07 00:09:38,787 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:09:38,788 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 147 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 918 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:38,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 918 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-07 00:09:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2024-11-07 00:09:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.7073170731707317) internal successors, (630), 369 states have internal predecessors, (630), 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:09:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 630 transitions. [2024-11-07 00:09:38,842 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 630 transitions. Word has length 110 [2024-11-07 00:09:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:38,844 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 630 transitions. [2024-11-07 00:09:38,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 630 transitions. [2024-11-07 00:09:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 00:09:38,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:38,851 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] [2024-11-07 00:09:38,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:09:38,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:38,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1805511230, now seen corresponding path program 1 times [2024-11-07 00:09:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052619396] [2024-11-07 00:09:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:39,063 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:09:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052619396] [2024-11-07 00:09:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052619396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664220777] [2024-11-07 00:09:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:39,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:39,067 INFO L87 Difference]: Start difference. First operand 370 states and 630 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:39,115 INFO L93 Difference]: Finished difference Result 722 states and 1246 transitions. [2024-11-07 00:09:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2024-11-07 00:09:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:39,120 INFO L225 Difference]: With dead ends: 722 [2024-11-07 00:09:39,120 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 00:09:39,121 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:09:39,123 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 926 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:09:39,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 926 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 00:09:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2024-11-07 00:09:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.7204502814258913) internal successors, (917), 533 states have internal predecessors, (917), 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:09:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 917 transitions. [2024-11-07 00:09:39,144 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 917 transitions. Word has length 113 [2024-11-07 00:09:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:39,145 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 917 transitions. [2024-11-07 00:09:39,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 917 transitions. [2024-11-07 00:09:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 00:09:39,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:39,148 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] [2024-11-07 00:09:39,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:09:39,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 554471209, now seen corresponding path program 1 times [2024-11-07 00:09:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860443616] [2024-11-07 00:09:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:39,391 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:09:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860443616] [2024-11-07 00:09:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860443616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:39,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836645074] [2024-11-07 00:09:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:39,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:39,396 INFO L87 Difference]: Start difference. First operand 534 states and 917 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:09:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:39,444 INFO L93 Difference]: Finished difference Result 1194 states and 2071 transitions. [2024-11-07 00:09:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2024-11-07 00:09:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:39,451 INFO L225 Difference]: With dead ends: 1194 [2024-11-07 00:09:39,451 INFO L226 Difference]: Without dead ends: 844 [2024-11-07 00:09:39,453 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:09:39,455 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 141 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 927 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:09:39,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 927 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-07 00:09:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 842. [2024-11-07 00:09:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.727705112960761) internal successors, (1453), 841 states have internal predecessors, (1453), 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:09:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1453 transitions. [2024-11-07 00:09:39,493 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1453 transitions. Word has length 116 [2024-11-07 00:09:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:39,494 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1453 transitions. [2024-11-07 00:09:39,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:09:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1453 transitions. [2024-11-07 00:09:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:09:39,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:39,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] [2024-11-07 00:09:39,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:09:39,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1608797487, now seen corresponding path program 1 times [2024-11-07 00:09:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745934383] [2024-11-07 00:09:39,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:39,722 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:09:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745934383] [2024-11-07 00:09:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745934383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973078243] [2024-11-07 00:09:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:39,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:39,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:39,725 INFO L87 Difference]: Start difference. First operand 842 states and 1453 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:09:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:39,776 INFO L93 Difference]: Finished difference Result 2078 states and 3607 transitions. [2024-11-07 00:09:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-11-07 00:09:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:39,787 INFO L225 Difference]: With dead ends: 2078 [2024-11-07 00:09:39,788 INFO L226 Difference]: Without dead ends: 1420 [2024-11-07 00:09:39,789 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:09:39,791 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 134 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 928 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:09:39,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 928 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-07 00:09:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1418. [2024-11-07 00:09:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.7282992237120678) internal successors, (2449), 1417 states have internal predecessors, (2449), 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:09:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2449 transitions. [2024-11-07 00:09:39,846 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2449 transitions. Word has length 119 [2024-11-07 00:09:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:39,850 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2449 transitions. [2024-11-07 00:09:39,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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:09:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2449 transitions. [2024-11-07 00:09:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:09:39,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:39,853 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] [2024-11-07 00:09:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:09:39,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1075950620, now seen corresponding path program 1 times [2024-11-07 00:09:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524784479] [2024-11-07 00:09:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:40,138 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:09:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524784479] [2024-11-07 00:09:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524784479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:09:40,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851015078] [2024-11-07 00:09:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:09:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:09:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:40,142 INFO L87 Difference]: Start difference. First operand 1418 states and 2449 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:09:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:40,498 INFO L93 Difference]: Finished difference Result 7226 states and 12641 transitions. [2024-11-07 00:09:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:09:40,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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 122 [2024-11-07 00:09:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:40,529 INFO L225 Difference]: With dead ends: 7226 [2024-11-07 00:09:40,530 INFO L226 Difference]: Without dead ends: 5992 [2024-11-07 00:09:40,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:09:40,537 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1584 mSDsluCounter, 3419 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 3893 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:40,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 3893 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:09:40,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2024-11-07 00:09:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 2566. [2024-11-07 00:09:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.7317738791423003) internal successors, (4442), 2565 states have internal predecessors, (4442), 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:09:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 4442 transitions. [2024-11-07 00:09:40,712 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 4442 transitions. Word has length 122 [2024-11-07 00:09:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:40,713 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 4442 transitions. [2024-11-07 00:09:40,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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:09:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 4442 transitions. [2024-11-07 00:09:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:09:40,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:40,717 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] [2024-11-07 00:09:40,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:09:40,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:40,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1195091427, now seen corresponding path program 1 times [2024-11-07 00:09:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800906439] [2024-11-07 00:09:40,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:40,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:40,921 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:09:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:40,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800906439] [2024-11-07 00:09:40,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800906439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:40,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:40,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231246014] [2024-11-07 00:09:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:40,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:40,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:40,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:40,924 INFO L87 Difference]: Start difference. First operand 2566 states and 4442 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:09:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:41,061 INFO L93 Difference]: Finished difference Result 7472 states and 13032 transitions. [2024-11-07 00:09:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 123 [2024-11-07 00:09:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:41,085 INFO L225 Difference]: With dead ends: 7472 [2024-11-07 00:09:41,085 INFO L226 Difference]: Without dead ends: 5090 [2024-11-07 00:09:41,091 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:09:41,092 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 511 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:41,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1418 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2024-11-07 00:09:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 3811. [2024-11-07 00:09:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3811 states, 3810 states have (on average 1.7341207349081365) internal successors, (6607), 3810 states have internal predecessors, (6607), 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:09:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 6607 transitions. [2024-11-07 00:09:41,229 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 6607 transitions. Word has length 123 [2024-11-07 00:09:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:41,230 INFO L471 AbstractCegarLoop]: Abstraction has 3811 states and 6607 transitions. [2024-11-07 00:09:41,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:09:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 6607 transitions. [2024-11-07 00:09:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:41,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:41,235 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] [2024-11-07 00:09:41,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:09:41,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:41,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash -273911601, now seen corresponding path program 1 times [2024-11-07 00:09:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590858513] [2024-11-07 00:09:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:41,427 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:09:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590858513] [2024-11-07 00:09:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590858513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848437540] [2024-11-07 00:09:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:41,429 INFO L87 Difference]: Start difference. First operand 3811 states and 6607 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:41,538 INFO L93 Difference]: Finished difference Result 8420 states and 14667 transitions. [2024-11-07 00:09:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:41,565 INFO L225 Difference]: With dead ends: 8420 [2024-11-07 00:09:41,566 INFO L226 Difference]: Without dead ends: 5845 [2024-11-07 00:09:41,572 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:09:41,573 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 156 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1061 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:09:41,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1061 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2024-11-07 00:09:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5843. [2024-11-07 00:09:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5843 states, 5842 states have (on average 1.7304005477576172) internal successors, (10109), 5842 states have internal predecessors, (10109), 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:09:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5843 states to 5843 states and 10109 transitions. [2024-11-07 00:09:41,756 INFO L78 Accepts]: Start accepts. Automaton has 5843 states and 10109 transitions. Word has length 124 [2024-11-07 00:09:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 5843 states and 10109 transitions. [2024-11-07 00:09:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 5843 states and 10109 transitions. [2024-11-07 00:09:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:41,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:41,759 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] [2024-11-07 00:09:41,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:09:41,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -878088599, now seen corresponding path program 1 times [2024-11-07 00:09:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115520184] [2024-11-07 00:09:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:41,935 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:09:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:41,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115520184] [2024-11-07 00:09:41,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115520184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:41,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:41,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668665865] [2024-11-07 00:09:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:41,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:41,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:41,937 INFO L87 Difference]: Start difference. First operand 5843 states and 10109 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:42,046 INFO L93 Difference]: Finished difference Result 11361 states and 19656 transitions. [2024-11-07 00:09:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:42,082 INFO L225 Difference]: With dead ends: 11361 [2024-11-07 00:09:42,082 INFO L226 Difference]: Without dead ends: 8247 [2024-11-07 00:09:42,091 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:09:42,092 INFO L432 NwaCegarLoop]: 605 mSDtfsCounter, 149 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1055 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:09:42,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1055 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8247 states. [2024-11-07 00:09:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8247 to 8245. [2024-11-07 00:09:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8245 states, 8244 states have (on average 1.7211305191654536) internal successors, (14189), 8244 states have internal predecessors, (14189), 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:09:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8245 states to 8245 states and 14189 transitions. [2024-11-07 00:09:42,369 INFO L78 Accepts]: Start accepts. Automaton has 8245 states and 14189 transitions. Word has length 124 [2024-11-07 00:09:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:42,370 INFO L471 AbstractCegarLoop]: Abstraction has 8245 states and 14189 transitions. [2024-11-07 00:09:42,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8245 states and 14189 transitions. [2024-11-07 00:09:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:42,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:42,375 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] [2024-11-07 00:09:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:09:42,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1383031511, now seen corresponding path program 1 times [2024-11-07 00:09:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062571950] [2024-11-07 00:09:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:09:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062571950] [2024-11-07 00:09:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062571950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220597544] [2024-11-07 00:09:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:42,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:42,521 INFO L87 Difference]: Start difference. First operand 8245 states and 14189 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:42,738 INFO L93 Difference]: Finished difference Result 16020 states and 27562 transitions. [2024-11-07 00:09:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:42,773 INFO L225 Difference]: With dead ends: 16020 [2024-11-07 00:09:42,773 INFO L226 Difference]: Without dead ends: 11610 [2024-11-07 00:09:42,783 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:09:42,783 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 135 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1006 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:09:42,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1006 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:09:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11610 states. [2024-11-07 00:09:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11610 to 11608. [2024-11-07 00:09:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11608 states, 11607 states have (on average 1.7102610493667614) internal successors, (19851), 11607 states have internal predecessors, (19851), 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:09:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11608 states to 11608 states and 19851 transitions. [2024-11-07 00:09:43,145 INFO L78 Accepts]: Start accepts. Automaton has 11608 states and 19851 transitions. Word has length 124 [2024-11-07 00:09:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 11608 states and 19851 transitions. [2024-11-07 00:09:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11608 states and 19851 transitions. [2024-11-07 00:09:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:43,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:43,148 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] [2024-11-07 00:09:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:09:43,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 762493491, now seen corresponding path program 1 times [2024-11-07 00:09:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137722421] [2024-11-07 00:09:43,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:43,357 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:09:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137722421] [2024-11-07 00:09:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137722421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:43,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785281397] [2024-11-07 00:09:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:43,359 INFO L87 Difference]: Start difference. First operand 11608 states and 19851 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:09:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:43,739 INFO L93 Difference]: Finished difference Result 37773 states and 64662 transitions. [2024-11-07 00:09:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:43,821 INFO L225 Difference]: With dead ends: 37773 [2024-11-07 00:09:43,821 INFO L226 Difference]: Without dead ends: 26396 [2024-11-07 00:09:43,850 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:09:43,851 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 509 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1533 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:09:43,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1533 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26396 states. [2024-11-07 00:09:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26396 to 18943. [2024-11-07 00:09:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18943 states, 18942 states have (on average 1.7017210431844578) internal successors, (32234), 18942 states have internal predecessors, (32234), 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:09:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18943 states to 18943 states and 32234 transitions. [2024-11-07 00:09:44,530 INFO L78 Accepts]: Start accepts. Automaton has 18943 states and 32234 transitions. Word has length 124 [2024-11-07 00:09:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:44,530 INFO L471 AbstractCegarLoop]: Abstraction has 18943 states and 32234 transitions. [2024-11-07 00:09:44,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:09:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 18943 states and 32234 transitions. [2024-11-07 00:09:44,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:09:44,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:44,532 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] [2024-11-07 00:09:44,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:09:44,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:44,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash -891868657, now seen corresponding path program 1 times [2024-11-07 00:09:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361859167] [2024-11-07 00:09:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:44,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:44,753 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:09:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361859167] [2024-11-07 00:09:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361859167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:09:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424098619] [2024-11-07 00:09:44,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:44,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:09:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:44,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:09:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:09:44,756 INFO L87 Difference]: Start difference. First operand 18943 states and 32234 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:45,135 INFO L93 Difference]: Finished difference Result 36967 states and 62846 transitions. [2024-11-07 00:09:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:09:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:09:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:45,210 INFO L225 Difference]: With dead ends: 36967 [2024-11-07 00:09:45,210 INFO L226 Difference]: Without dead ends: 26590 [2024-11-07 00:09:45,238 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:09:45,241 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 142 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1040 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:09:45,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1040 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26590 states. [2024-11-07 00:09:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26590 to 26588. [2024-11-07 00:09:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26588 states, 26587 states have (on average 1.6884191522172491) internal successors, (44890), 26587 states have internal predecessors, (44890), 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:09:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26588 states to 26588 states and 44890 transitions. [2024-11-07 00:09:46,062 INFO L78 Accepts]: Start accepts. Automaton has 26588 states and 44890 transitions. Word has length 124 [2024-11-07 00:09:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 26588 states and 44890 transitions. [2024-11-07 00:09:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:09:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 26588 states and 44890 transitions. [2024-11-07 00:09:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:09:46,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:46,065 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] [2024-11-07 00:09:46,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:09:46,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:46,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 405863706, now seen corresponding path program 1 times [2024-11-07 00:09:46,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:46,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724870433] [2024-11-07 00:09:46,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:46,278 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:09:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:46,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724870433] [2024-11-07 00:09:46,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724870433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:46,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:46,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309321082] [2024-11-07 00:09:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:46,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:46,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:46,280 INFO L87 Difference]: Start difference. First operand 26588 states and 44890 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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:09:47,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:47,165 INFO L93 Difference]: Finished difference Result 86928 states and 146856 transitions. [2024-11-07 00:09:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:47,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 125 [2024-11-07 00:09:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:47,357 INFO L225 Difference]: With dead ends: 86928 [2024-11-07 00:09:47,357 INFO L226 Difference]: Without dead ends: 60556 [2024-11-07 00:09:47,405 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:09:47,406 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 507 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1535 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:09:47,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1535 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60556 states. [2024-11-07 00:09:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60556 to 43429. [2024-11-07 00:09:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43429 states, 43428 states have (on average 1.6786174818089712) internal successors, (72899), 43428 states have internal predecessors, (72899), 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:09:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43429 states to 43429 states and 72899 transitions. [2024-11-07 00:09:48,730 INFO L78 Accepts]: Start accepts. Automaton has 43429 states and 72899 transitions. Word has length 125 [2024-11-07 00:09:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 43429 states and 72899 transitions. [2024-11-07 00:09:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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:09:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 43429 states and 72899 transitions. [2024-11-07 00:09:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:09:48,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:48,732 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] [2024-11-07 00:09:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:09:48,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:48,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1890720694, now seen corresponding path program 1 times [2024-11-07 00:09:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305831713] [2024-11-07 00:09:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:48,902 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:09:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305831713] [2024-11-07 00:09:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305831713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:48,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:09:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499124509] [2024-11-07 00:09:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:48,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:09:48,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:09:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:09:48,904 INFO L87 Difference]: Start difference. First operand 43429 states and 72899 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:09:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:50,343 INFO L93 Difference]: Finished difference Result 140382 states and 235806 transitions. [2024-11-07 00:09:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:09:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2024-11-07 00:09:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:50,723 INFO L225 Difference]: With dead ends: 140382 [2024-11-07 00:09:50,724 INFO L226 Difference]: Without dead ends: 97169 [2024-11-07 00:09:50,794 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:09:50,795 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 505 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:50,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1520 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97169 states. [2024-11-07 00:09:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97169 to 70074. [2024-11-07 00:09:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70074 states, 70073 states have (on average 1.6691735761277524) internal successors, (116964), 70073 states have internal predecessors, (116964), 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:09:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70074 states to 70074 states and 116964 transitions. [2024-11-07 00:09:52,997 INFO L78 Accepts]: Start accepts. Automaton has 70074 states and 116964 transitions. Word has length 126 [2024-11-07 00:09:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 70074 states and 116964 transitions. [2024-11-07 00:09:52,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:09:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 70074 states and 116964 transitions. [2024-11-07 00:09:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 00:09:52,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:52,999 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] [2024-11-07 00:09:52,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:09:53,000 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1867393570, now seen corresponding path program 1 times [2024-11-07 00:09:53,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:53,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825634722] [2024-11-07 00:09:53,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:53,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:53,396 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:09:53,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:53,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825634722] [2024-11-07 00:09:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825634722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:53,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:09:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14203552] [2024-11-07 00:09:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:53,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:09:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:09:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:53,400 INFO L87 Difference]: Start difference. First operand 70074 states and 116964 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:54,571 INFO L93 Difference]: Finished difference Result 139934 states and 233575 transitions. [2024-11-07 00:09:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:09:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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 128 [2024-11-07 00:09:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:54,732 INFO L225 Difference]: With dead ends: 139934 [2024-11-07 00:09:54,732 INFO L226 Difference]: Without dead ends: 70076 [2024-11-07 00:09:54,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:54,794 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 543 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:54,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1796 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70076 states. [2024-11-07 00:09:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70076 to 70074. [2024-11-07 00:09:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70074 states, 70073 states have (on average 1.6602543062235098) internal successors, (116339), 70073 states have internal predecessors, (116339), 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:09:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70074 states to 70074 states and 116339 transitions. [2024-11-07 00:09:56,462 INFO L78 Accepts]: Start accepts. Automaton has 70074 states and 116339 transitions. Word has length 128 [2024-11-07 00:09:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:09:56,463 INFO L471 AbstractCegarLoop]: Abstraction has 70074 states and 116339 transitions. [2024-11-07 00:09:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 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:09:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 70074 states and 116339 transitions. [2024-11-07 00:09:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 00:09:56,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:09:56,465 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] [2024-11-07 00:09:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:09:56,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:09:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:09:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2058022941, now seen corresponding path program 1 times [2024-11-07 00:09:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:09:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218235203] [2024-11-07 00:09:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:09:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:09:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:09:57,001 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:09:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:09:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218235203] [2024-11-07 00:09:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218235203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:09:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:09:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:09:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438849283] [2024-11-07 00:09:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:09:57,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:09:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:09:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:09:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:09:57,004 INFO L87 Difference]: Start difference. First operand 70074 states and 116339 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:09:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:09:58,542 INFO L93 Difference]: Finished difference Result 204940 states and 340651 transitions. [2024-11-07 00:09:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:09:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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 131 [2024-11-07 00:09:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:09:58,796 INFO L225 Difference]: With dead ends: 204940 [2024-11-07 00:09:58,796 INFO L226 Difference]: Without dead ends: 135082 [2024-11-07 00:09:58,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:09:58,863 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 136 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:09:58,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2258 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:09:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135082 states. [2024-11-07 00:10:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135082 to 135080. [2024-11-07 00:10:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135080 states, 135079 states have (on average 1.6482798954685776) internal successors, (222648), 135079 states have internal predecessors, (222648), 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:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135080 states to 135080 states and 222648 transitions. [2024-11-07 00:10:01,618 INFO L78 Accepts]: Start accepts. Automaton has 135080 states and 222648 transitions. Word has length 131 [2024-11-07 00:10:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:01,618 INFO L471 AbstractCegarLoop]: Abstraction has 135080 states and 222648 transitions. [2024-11-07 00:10:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 135080 states and 222648 transitions. [2024-11-07 00:10:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:10:01,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:01,620 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] [2024-11-07 00:10:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:10:01,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1057143669, now seen corresponding path program 1 times [2024-11-07 00:10:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590445469] [2024-11-07 00:10:01,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:02,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:10:02,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:02,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590445469] [2024-11-07 00:10:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590445469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:02,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:02,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:10:02,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357206351] [2024-11-07 00:10:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:02,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:10:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:02,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:10:02,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:10:02,289 INFO L87 Difference]: Start difference. First operand 135080 states and 222648 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:03,863 INFO L93 Difference]: Finished difference Result 140890 states and 230393 transitions. [2024-11-07 00:10:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:10:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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 132 [2024-11-07 00:10:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:04,103 INFO L225 Difference]: With dead ends: 140890 [2024-11-07 00:10:04,103 INFO L226 Difference]: Without dead ends: 140888 [2024-11-07 00:10:04,144 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:04,144 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:04,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1897 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:10:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140888 states. [2024-11-07 00:10:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140888 to 140888. [2024-11-07 00:10:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140888 states, 140887 states have (on average 1.6213632201693555) internal successors, (228429), 140887 states have internal predecessors, (228429), 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:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140888 states to 140888 states and 228429 transitions. [2024-11-07 00:10:06,848 INFO L78 Accepts]: Start accepts. Automaton has 140888 states and 228429 transitions. Word has length 132 [2024-11-07 00:10:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:06,848 INFO L471 AbstractCegarLoop]: Abstraction has 140888 states and 228429 transitions. [2024-11-07 00:10:06,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 140888 states and 228429 transitions. [2024-11-07 00:10:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:10:06,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:06,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:10:06,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1175866632, now seen corresponding path program 1 times [2024-11-07 00:10:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935315552] [2024-11-07 00:10:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:10:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935315552] [2024-11-07 00:10:07,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935315552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:07,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:07,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:10:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811236695] [2024-11-07 00:10:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:07,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:10:07,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:10:07,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:10:07,167 INFO L87 Difference]: Start difference. First operand 140888 states and 228429 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:10,477 INFO L93 Difference]: Finished difference Result 388610 states and 631632 transitions. [2024-11-07 00:10:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:10:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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 168 [2024-11-07 00:10:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:11,165 INFO L225 Difference]: With dead ends: 388610 [2024-11-07 00:10:11,165 INFO L226 Difference]: Without dead ends: 324808 [2024-11-07 00:10:11,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:10:11,295 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 1130 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:11,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2495 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324808 states. [2024-11-07 00:10:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324808 to 227548. [2024-11-07 00:10:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227548 states, 227547 states have (on average 1.6179822190580408) internal successors, (368167), 227547 states have internal predecessors, (368167), 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:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227548 states to 227548 states and 368167 transitions. [2024-11-07 00:10:17,267 INFO L78 Accepts]: Start accepts. Automaton has 227548 states and 368167 transitions. Word has length 168 [2024-11-07 00:10:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:10:17,268 INFO L471 AbstractCegarLoop]: Abstraction has 227548 states and 368167 transitions. [2024-11-07 00:10:17,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 227548 states and 368167 transitions. [2024-11-07 00:10:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:10:17,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:10:17,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:10:17,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:10:17,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:10:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1780043630, now seen corresponding path program 1 times [2024-11-07 00:10:17,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:10:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070571212] [2024-11-07 00:10:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:10:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:10:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:10:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 00:10:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:10:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070571212] [2024-11-07 00:10:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070571212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:10:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:10:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:10:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575364908] [2024-11-07 00:10:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:10:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:10:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:10:17,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:10:17,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:10:17,648 INFO L87 Difference]: Start difference. First operand 227548 states and 368167 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:10:21,479 INFO L93 Difference]: Finished difference Result 437502 states and 711158 transitions. [2024-11-07 00:10:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:10:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 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 168 [2024-11-07 00:10:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:10:22,334 INFO L225 Difference]: With dead ends: 437502 [2024-11-07 00:10:22,334 INFO L226 Difference]: Without dead ends: 375000 [2024-11-07 00:10:22,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:10:22,522 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 1140 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:10:22,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2431 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:10:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375000 states.