./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_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_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', 'd0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0'] 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_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 d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:02:41,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:02:41,350 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:02:41,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:02:41,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:02:41,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:02:41,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:02:41,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:02:41,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:02:41,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:02:41,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:02:41,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:02:41,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:02:41,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:02:41,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:41,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:02:41,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:02:41,389 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 -> d0919f37d9ec3b35ef959618459b2f9ff909696f753b572bc67b87ebda7b05b0 [2024-11-07 00:02:41,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:02:41,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:02:41,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:02:41,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:02:41,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:02:41,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:43,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:02:43,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:02:43,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:43,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc336542f/8a62e5e8dc8a4271a7c4e7d886f9158f/FLAG29b1299d5 [2024-11-07 00:02:43,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cc336542f/8a62e5e8dc8a4271a7c4e7d886f9158f [2024-11-07 00:02:43,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:02:43,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:02:43,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:43,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:02:43,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:02:43,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:43,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0748b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43, skipping insertion in model container [2024-11-07 00:02:43,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:43,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:02:43,713 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_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2024-11-07 00:02:43,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:43,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:02:43,825 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_floodmax.4.1.ufo.BOUNDED-8.pals.c[24198,24211] [2024-11-07 00:02:43,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:02:43,842 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:02:43,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43 WrapperNode [2024-11-07 00:02:43,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:02:43,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:43,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:02:43,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:02:43,852 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:02:43" (1/1) ... [2024-11-07 00:02:43,867 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:02:43" (1/1) ... [2024-11-07 00:02:43,939 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 934 [2024-11-07 00:02:43,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:02:43,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:02:43,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:02:43,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:02:43,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:43,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:43,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:43,998 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:02:44,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:02:44,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:02:44,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:02:44,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:02:44,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (1/1) ... [2024-11-07 00:02:44,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:02:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:02:44,114 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:02:44,117 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:02:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:02:44,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:02:44,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:02:44,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:02:44,279 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:02:44,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:02:45,301 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-11-07 00:02:45,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:02:45,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:02:45,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:02:45,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:45 BoogieIcfgContainer [2024-11-07 00:02:45,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:02:45,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:02:45,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:02:45,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:02:45,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:02:43" (1/3) ... [2024-11-07 00:02:45,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cedb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:45, skipping insertion in model container [2024-11-07 00:02:45,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:02:43" (2/3) ... [2024-11-07 00:02:45,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9cedb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:02:45, skipping insertion in model container [2024-11-07 00:02:45,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:02:45" (3/3) ... [2024-11-07 00:02:45,331 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2024-11-07 00:02:45,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:02:45,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:02:45,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:02:45,413 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;@1764b14e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:02:45,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:02:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 266 states have (on average 1.8270676691729324) internal successors, (486), 267 states have internal predecessors, (486), 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:02:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:45,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:45,430 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:02:45,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:45,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:45,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1982504400, now seen corresponding path program 1 times [2024-11-07 00:02:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:45,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976503558] [2024-11-07 00:02:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:45,942 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:02:45,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976503558] [2024-11-07 00:02:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976503558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:45,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:02:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498017462] [2024-11-07 00:02:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:45,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:02:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:02:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:02:45,974 INFO L87 Difference]: Start difference. First operand has 268 states, 266 states have (on average 1.8270676691729324) internal successors, (486), 267 states have internal predecessors, (486), 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:02:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:46,011 INFO L93 Difference]: Finished difference Result 357 states and 642 transitions. [2024-11-07 00:02:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:02:46,013 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:02:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:46,021 INFO L225 Difference]: With dead ends: 357 [2024-11-07 00:02:46,023 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 00:02:46,026 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:02:46,031 INFO L432 NwaCegarLoop]: 483 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, 483 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:02:46,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 00:02:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-07 00:02:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.8212927756653992) internal successors, (479), 263 states have internal predecessors, (479), 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:02:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 479 transitions. [2024-11-07 00:02:46,071 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 479 transitions. Word has length 77 [2024-11-07 00:02:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 479 transitions. [2024-11-07 00:02:46,072 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:02:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 479 transitions. [2024-11-07 00:02:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:02:46,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:46,074 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:02:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:02:46,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2116517906, now seen corresponding path program 1 times [2024-11-07 00:02:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150678528] [2024-11-07 00:02:46,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:46,555 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:02:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150678528] [2024-11-07 00:02:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150678528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:46,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:02:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076812546] [2024-11-07 00:02:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:46,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:02:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:02:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:02:46,560 INFO L87 Difference]: Start difference. First operand 264 states and 479 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:02:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:46,678 INFO L93 Difference]: Finished difference Result 352 states and 632 transitions. [2024-11-07 00:02:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:02:46,680 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:02:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:46,684 INFO L225 Difference]: With dead ends: 352 [2024-11-07 00:02:46,685 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 00:02:46,685 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:02:46,686 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 0 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1873 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 00:02:46,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-07 00:02:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.7072243346007605) internal successors, (449), 263 states have internal predecessors, (449), 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:02:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 449 transitions. [2024-11-07 00:02:46,713 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 449 transitions. Word has length 77 [2024-11-07 00:02:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:46,714 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 449 transitions. [2024-11-07 00:02:46,714 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:02:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 449 transitions. [2024-11-07 00:02:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 00:02:46,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:46,722 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] [2024-11-07 00:02:46,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:02:46,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:46,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:46,723 INFO L85 PathProgramCache]: Analyzing trace with hash -441999764, now seen corresponding path program 1 times [2024-11-07 00:02:46,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:46,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669873414] [2024-11-07 00:02:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:47,024 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:02:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:47,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669873414] [2024-11-07 00:02:47,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669873414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:47,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16041176] [2024-11-07 00:02:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:47,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:47,026 INFO L87 Difference]: Start difference. First operand 264 states and 449 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:02:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:47,088 INFO L93 Difference]: Finished difference Result 421 states and 726 transitions. [2024-11-07 00:02:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:47,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2024-11-07 00:02:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:47,091 INFO L225 Difference]: With dead ends: 421 [2024-11-07 00:02:47,092 INFO L226 Difference]: Without dead ends: 337 [2024-11-07 00:02:47,093 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:02:47,094 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 120 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 965 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:02:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 965 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-07 00:02:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-07 00:02:47,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.7095808383233533) internal successors, (571), 334 states have internal predecessors, (571), 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:02:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 571 transitions. [2024-11-07 00:02:47,120 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 571 transitions. Word has length 106 [2024-11-07 00:02:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:47,120 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 571 transitions. [2024-11-07 00:02:47,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:02:47,120 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 571 transitions. [2024-11-07 00:02:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 00:02:47,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:47,125 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] [2024-11-07 00:02:47,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:02:47,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:47,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1981863410, now seen corresponding path program 1 times [2024-11-07 00:02:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416275823] [2024-11-07 00:02:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:47,317 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:02:47,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:47,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416275823] [2024-11-07 00:02:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416275823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:47,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:47,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990587581] [2024-11-07 00:02:47,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:47,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:47,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:47,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:47,321 INFO L87 Difference]: Start difference. First operand 335 states and 571 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:02:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:47,359 INFO L93 Difference]: Finished difference Result 491 states and 846 transitions. [2024-11-07 00:02:47,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2024-11-07 00:02:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:47,365 INFO L225 Difference]: With dead ends: 491 [2024-11-07 00:02:47,365 INFO L226 Difference]: Without dead ends: 407 [2024-11-07 00:02:47,365 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:02:47,366 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 129 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 987 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:02:47,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 987 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-07 00:02:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-11-07 00:02:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.7178217821782178) internal successors, (694), 404 states have internal predecessors, (694), 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:02:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 694 transitions. [2024-11-07 00:02:47,391 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 694 transitions. Word has length 109 [2024-11-07 00:02:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 694 transitions. [2024-11-07 00:02:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:02:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 694 transitions. [2024-11-07 00:02:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 00:02:47,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:47,396 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] [2024-11-07 00:02:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:02:47,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:47,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 199343397, now seen corresponding path program 1 times [2024-11-07 00:02:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065272278] [2024-11-07 00:02:47,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:47,594 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:02:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065272278] [2024-11-07 00:02:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065272278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425713380] [2024-11-07 00:02:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:47,596 INFO L87 Difference]: Start difference. First operand 405 states and 694 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:02:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:47,635 INFO L93 Difference]: Finished difference Result 824 states and 1427 transitions. [2024-11-07 00:02:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2024-11-07 00:02:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:47,642 INFO L225 Difference]: With dead ends: 824 [2024-11-07 00:02:47,642 INFO L226 Difference]: Without dead ends: 601 [2024-11-07 00:02:47,644 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:02:47,645 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 121 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 875 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:02:47,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 875 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-07 00:02:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2024-11-07 00:02:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.7240802675585285) internal successors, (1031), 598 states have internal predecessors, (1031), 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:02:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1031 transitions. [2024-11-07 00:02:47,678 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1031 transitions. Word has length 109 [2024-11-07 00:02:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 1031 transitions. [2024-11-07 00:02:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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:02:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1031 transitions. [2024-11-07 00:02:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 00:02:47,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:47,680 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] [2024-11-07 00:02:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:02:47,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1318210130, now seen corresponding path program 1 times [2024-11-07 00:02:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329287203] [2024-11-07 00:02:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:47,888 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:02:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329287203] [2024-11-07 00:02:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329287203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836154627] [2024-11-07 00:02:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:47,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:47,890 INFO L87 Difference]: Start difference. First operand 599 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:02:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:47,950 INFO L93 Difference]: Finished difference Result 1379 states and 2387 transitions. [2024-11-07 00:02:47,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 112 [2024-11-07 00:02:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:47,956 INFO L225 Difference]: With dead ends: 1379 [2024-11-07 00:02:47,956 INFO L226 Difference]: Without dead ends: 962 [2024-11-07 00:02:47,957 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:02:47,957 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 114 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 949 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:02:47,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 949 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-07 00:02:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 960. [2024-11-07 00:02:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.721584984358707) internal successors, (1651), 959 states have internal predecessors, (1651), 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:02:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1651 transitions. [2024-11-07 00:02:48,000 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1651 transitions. Word has length 112 [2024-11-07 00:02:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:48,000 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1651 transitions. [2024-11-07 00:02:48,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:02:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1651 transitions. [2024-11-07 00:02:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:02:48,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:48,002 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] [2024-11-07 00:02:48,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:02:48,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 808675664, now seen corresponding path program 1 times [2024-11-07 00:02:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105508413] [2024-11-07 00:02:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:48,159 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:02:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105508413] [2024-11-07 00:02:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105508413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:48,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:48,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143921440] [2024-11-07 00:02:48,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:48,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:48,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:48,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:48,162 INFO L87 Difference]: Start difference. First operand 960 states and 1651 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:02:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:48,211 INFO L93 Difference]: Finished difference Result 1735 states and 2995 transitions. [2024-11-07 00:02:48,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2024-11-07 00:02:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:48,219 INFO L225 Difference]: With dead ends: 1735 [2024-11-07 00:02:48,219 INFO L226 Difference]: Without dead ends: 1318 [2024-11-07 00:02:48,220 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:02:48,222 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 115 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 950 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:02:48,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 950 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-11-07 00:02:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-11-07 00:02:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1315 states have (on average 1.7163498098859316) internal successors, (2257), 1315 states have internal predecessors, (2257), 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:02:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2257 transitions. [2024-11-07 00:02:48,267 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2257 transitions. Word has length 115 [2024-11-07 00:02:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:48,267 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 2257 transitions. [2024-11-07 00:02:48,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:02:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2257 transitions. [2024-11-07 00:02:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 00:02:48,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:48,271 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] [2024-11-07 00:02:48,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:02:48,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2008018839, now seen corresponding path program 1 times [2024-11-07 00:02:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140601096] [2024-11-07 00:02:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:48,445 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:02:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140601096] [2024-11-07 00:02:48,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140601096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:48,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:48,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88359680] [2024-11-07 00:02:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:48,447 INFO L87 Difference]: Start difference. First operand 1316 states and 2257 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:02:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:48,519 INFO L93 Difference]: Finished difference Result 3372 states and 5781 transitions. [2024-11-07 00:02:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2024-11-07 00:02:48,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:48,530 INFO L225 Difference]: With dead ends: 3372 [2024-11-07 00:02:48,530 INFO L226 Difference]: Without dead ends: 2263 [2024-11-07 00:02:48,535 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:02:48,537 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 107 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 940 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:02:48,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 940 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2024-11-07 00:02:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2261. [2024-11-07 00:02:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.702212389380531) internal successors, (3847), 2260 states have internal predecessors, (3847), 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:02:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3847 transitions. [2024-11-07 00:02:48,610 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3847 transitions. Word has length 115 [2024-11-07 00:02:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:48,610 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 3847 transitions. [2024-11-07 00:02:48,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:02:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3847 transitions. [2024-11-07 00:02:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:02:48,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:48,615 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] [2024-11-07 00:02:48,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:02:48,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:48,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:48,617 INFO L85 PathProgramCache]: Analyzing trace with hash -192090857, now seen corresponding path program 1 times [2024-11-07 00:02:48,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:48,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502345389] [2024-11-07 00:02:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:48,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:48,752 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:02:48,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502345389] [2024-11-07 00:02:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502345389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938149899] [2024-11-07 00:02:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:48,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:48,754 INFO L87 Difference]: Start difference. First operand 2261 states and 3847 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:02:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:48,812 INFO L93 Difference]: Finished difference Result 4241 states and 7231 transitions. [2024-11-07 00:02:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:48,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 118 [2024-11-07 00:02:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:48,825 INFO L225 Difference]: With dead ends: 4241 [2024-11-07 00:02:48,826 INFO L226 Difference]: Without dead ends: 3132 [2024-11-07 00:02:48,828 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:02:48,828 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 108 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 940 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:02:48,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 940 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2024-11-07 00:02:48,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 3130. [2024-11-07 00:02:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.6922339405560882) internal successors, (5295), 3129 states have internal predecessors, (5295), 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:02:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 5295 transitions. [2024-11-07 00:02:48,916 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 5295 transitions. Word has length 118 [2024-11-07 00:02:48,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:48,916 INFO L471 AbstractCegarLoop]: Abstraction has 3130 states and 5295 transitions. [2024-11-07 00:02:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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:02:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 5295 transitions. [2024-11-07 00:02:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 00:02:48,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:48,918 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] [2024-11-07 00:02:48,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:02:48,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:48,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1439028562, now seen corresponding path program 1 times [2024-11-07 00:02:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815947446] [2024-11-07 00:02:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:49,179 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:02:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815947446] [2024-11-07 00:02:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815947446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:02:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623176624] [2024-11-07 00:02:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:49,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:02:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:02:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:02:49,183 INFO L87 Difference]: Start difference. First operand 3130 states and 5295 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:02:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:49,684 INFO L93 Difference]: Finished difference Result 18939 states and 32403 transitions. [2024-11-07 00:02:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:02:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 118 [2024-11-07 00:02:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:49,754 INFO L225 Difference]: With dead ends: 18939 [2024-11-07 00:02:49,755 INFO L226 Difference]: Without dead ends: 16030 [2024-11-07 00:02:49,766 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:02:49,767 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1230 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:02:49,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 3055 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:02:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16030 states. [2024-11-07 00:02:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16030 to 5935. [2024-11-07 00:02:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 5934 states have (on average 1.6846983485001685) internal successors, (9997), 5934 states have internal predecessors, (9997), 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:02:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 9997 transitions. [2024-11-07 00:02:50,092 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 9997 transitions. Word has length 118 [2024-11-07 00:02:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:50,092 INFO L471 AbstractCegarLoop]: Abstraction has 5935 states and 9997 transitions. [2024-11-07 00:02:50,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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:02:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 9997 transitions. [2024-11-07 00:02:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:02:50,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:50,094 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:02:50,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:02:50,094 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:50,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 540148013, now seen corresponding path program 1 times [2024-11-07 00:02:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846446857] [2024-11-07 00:02:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:50,261 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:02:50,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846446857] [2024-11-07 00:02:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846446857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:50,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:50,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:02:50,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040990840] [2024-11-07 00:02:50,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:50,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:02:50,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:50,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:02:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:02:50,264 INFO L87 Difference]: Start difference. First operand 5935 states and 9997 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 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:02:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:50,541 INFO L93 Difference]: Finished difference Result 19395 states and 32907 transitions. [2024-11-07 00:02:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:02:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 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:02:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:50,574 INFO L225 Difference]: With dead ends: 19395 [2024-11-07 00:02:50,574 INFO L226 Difference]: Without dead ends: 13691 [2024-11-07 00:02:50,585 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:02:50,586 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 423 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1415 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:02:50,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1415 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13691 states. [2024-11-07 00:02:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13691 to 9776. [2024-11-07 00:02:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9776 states, 9775 states have (on average 1.6843989769820973) internal successors, (16465), 9775 states have internal predecessors, (16465), 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:02:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9776 states to 9776 states and 16465 transitions. [2024-11-07 00:02:50,906 INFO L78 Accepts]: Start accepts. Automaton has 9776 states and 16465 transitions. Word has length 119 [2024-11-07 00:02:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:50,907 INFO L471 AbstractCegarLoop]: Abstraction has 9776 states and 16465 transitions. [2024-11-07 00:02:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 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:02:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9776 states and 16465 transitions. [2024-11-07 00:02:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 00:02:50,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:50,908 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:02:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:02:50,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1327182137, now seen corresponding path program 1 times [2024-11-07 00:02:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118552340] [2024-11-07 00:02:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:51,009 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:02:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118552340] [2024-11-07 00:02:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118552340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:02:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688948976] [2024-11-07 00:02:51,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:02:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:51,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:02:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:02:51,012 INFO L87 Difference]: Start difference. First operand 9776 states and 16465 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:02:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:51,255 INFO L93 Difference]: Finished difference Result 19008 states and 32055 transitions. [2024-11-07 00:02:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:02:51,256 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:02:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:51,293 INFO L225 Difference]: With dead ends: 19008 [2024-11-07 00:02:51,293 INFO L226 Difference]: Without dead ends: 13734 [2024-11-07 00:02:51,305 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:02:51,305 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 122 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 986 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:02:51,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 986 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:02:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2024-11-07 00:02:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 13732. [2024-11-07 00:02:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13732 states, 13731 states have (on average 1.6718374481101157) internal successors, (22956), 13731 states have internal predecessors, (22956), 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:02:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13732 states to 13732 states and 22956 transitions. [2024-11-07 00:02:51,744 INFO L78 Accepts]: Start accepts. Automaton has 13732 states and 22956 transitions. Word has length 119 [2024-11-07 00:02:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:51,745 INFO L471 AbstractCegarLoop]: Abstraction has 13732 states and 22956 transitions. [2024-11-07 00:02:51,746 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:02:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 13732 states and 22956 transitions. [2024-11-07 00:02:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:02:51,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:51,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:02:51,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:02:51,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:51,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1934084037, now seen corresponding path program 1 times [2024-11-07 00:02:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440577332] [2024-11-07 00:02:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:52,002 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:02:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440577332] [2024-11-07 00:02:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440577332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:52,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:52,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:02:52,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433880781] [2024-11-07 00:02:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:52,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:02:52,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:52,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:02:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:02:52,004 INFO L87 Difference]: Start difference. First operand 13732 states and 22956 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:02:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:52,440 INFO L93 Difference]: Finished difference Result 45157 states and 75648 transitions. [2024-11-07 00:02:52,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:02:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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 120 [2024-11-07 00:02:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:52,533 INFO L225 Difference]: With dead ends: 45157 [2024-11-07 00:02:52,534 INFO L226 Difference]: Without dead ends: 31628 [2024-11-07 00:02:52,566 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:02:52,568 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 421 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1417 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:02:52,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1417 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31628 states. [2024-11-07 00:02:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31628 to 22591. [2024-11-07 00:02:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22591 states, 22590 states have (on average 1.6624169986719788) internal successors, (37554), 22590 states have internal predecessors, (37554), 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:02:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 37554 transitions. [2024-11-07 00:02:53,385 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 37554 transitions. Word has length 120 [2024-11-07 00:02:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:53,386 INFO L471 AbstractCegarLoop]: Abstraction has 22591 states and 37554 transitions. [2024-11-07 00:02:53,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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:02:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 37554 transitions. [2024-11-07 00:02:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 00:02:53,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:53,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:02:53,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:02:53,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:53,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1929535132, now seen corresponding path program 1 times [2024-11-07 00:02:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957546643] [2024-11-07 00:02:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:53,574 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:02:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957546643] [2024-11-07 00:02:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957546643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:02:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365113464] [2024-11-07 00:02:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:02:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:02:53,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:02:53,577 INFO L87 Difference]: Start difference. First operand 22591 states and 37554 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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:02:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:54,431 INFO L93 Difference]: Finished difference Result 74055 states and 123360 transitions. [2024-11-07 00:02:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:02:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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 121 [2024-11-07 00:02:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:54,588 INFO L225 Difference]: With dead ends: 74055 [2024-11-07 00:02:54,589 INFO L226 Difference]: Without dead ends: 51667 [2024-11-07 00:02:54,635 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:02:54,636 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 419 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1419 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:02:54,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51667 states. [2024-11-07 00:02:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51667 to 36986. [2024-11-07 00:02:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36986 states, 36985 states have (on average 1.653102609165878) internal successors, (61140), 36985 states have internal predecessors, (61140), 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:02:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36986 states to 36986 states and 61140 transitions. [2024-11-07 00:02:55,833 INFO L78 Accepts]: Start accepts. Automaton has 36986 states and 61140 transitions. Word has length 121 [2024-11-07 00:02:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:55,833 INFO L471 AbstractCegarLoop]: Abstraction has 36986 states and 61140 transitions. [2024-11-07 00:02:55,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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:02:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36986 states and 61140 transitions. [2024-11-07 00:02:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 00:02:55,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:55,835 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:02:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:02:55,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:55,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1273640740, now seen corresponding path program 1 times [2024-11-07 00:02:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:55,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398916226] [2024-11-07 00:02:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:56,008 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:02:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398916226] [2024-11-07 00:02:56,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398916226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:56,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:56,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:02:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392287311] [2024-11-07 00:02:56,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:56,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:02:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:56,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:02:56,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:02:56,010 INFO L87 Difference]: Start difference. First operand 36986 states and 61140 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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:02:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:02:57,042 INFO L93 Difference]: Finished difference Result 119881 states and 198592 transitions. [2024-11-07 00:02:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:02:57,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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:02:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:02:57,378 INFO L225 Difference]: With dead ends: 119881 [2024-11-07 00:02:57,379 INFO L226 Difference]: Without dead ends: 83098 [2024-11-07 00:02:57,429 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:02:57,429 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 417 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1421 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:02:57,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1421 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:02:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83098 states. [2024-11-07 00:02:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83098 to 59817. [2024-11-07 00:02:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59817 states, 59816 states have (on average 1.6441420355757657) internal successors, (98346), 59816 states have internal predecessors, (98346), 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:02:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59817 states to 59817 states and 98346 transitions. [2024-11-07 00:02:58,972 INFO L78 Accepts]: Start accepts. Automaton has 59817 states and 98346 transitions. Word has length 122 [2024-11-07 00:02:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:02:58,972 INFO L471 AbstractCegarLoop]: Abstraction has 59817 states and 98346 transitions. [2024-11-07 00:02:58,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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:02:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59817 states and 98346 transitions. [2024-11-07 00:02:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:02:58,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:02:58,974 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:02:58,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:02:58,975 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:02:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:02:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2119227980, now seen corresponding path program 1 times [2024-11-07 00:02:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:02:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083536104] [2024-11-07 00:02:58,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:02:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:02:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:02:59,421 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:02:59,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:02:59,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083536104] [2024-11-07 00:02:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083536104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:02:59,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:02:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:02:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365807399] [2024-11-07 00:02:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:02:59,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:02:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:02:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:02:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:02:59,422 INFO L87 Difference]: Start difference. First operand 59817 states and 98346 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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:03:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:00,762 INFO L93 Difference]: Finished difference Result 119433 states and 196361 transitions. [2024-11-07 00:03:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:00,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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:03:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:00,873 INFO L225 Difference]: With dead ends: 119433 [2024-11-07 00:03:00,873 INFO L226 Difference]: Without dead ends: 59819 [2024-11-07 00:03:00,916 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:03:00,919 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 324 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:00,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1682 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59819 states. [2024-11-07 00:03:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59819 to 59817. [2024-11-07 00:03:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59817 states, 59816 states have (on average 1.6336933262003477) internal successors, (97721), 59816 states have internal predecessors, (97721), 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:03:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59817 states to 59817 states and 97721 transitions. [2024-11-07 00:03:02,306 INFO L78 Accepts]: Start accepts. Automaton has 59817 states and 97721 transitions. Word has length 124 [2024-11-07 00:03:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:02,307 INFO L471 AbstractCegarLoop]: Abstraction has 59817 states and 97721 transitions. [2024-11-07 00:03:02,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 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:03:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59817 states and 97721 transitions. [2024-11-07 00:03:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:03:02,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:02,309 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] [2024-11-07 00:03:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:03:02,309 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1050996583, now seen corresponding path program 1 times [2024-11-07 00:03:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621159766] [2024-11-07 00:03:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:02,799 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:03:02,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:02,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621159766] [2024-11-07 00:03:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621159766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:03:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65963879] [2024-11-07 00:03:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:02,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:03:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:02,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:03:02,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:03:02,802 INFO L87 Difference]: Start difference. First operand 59817 states and 97721 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:03:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:04,095 INFO L93 Difference]: Finished difference Result 174951 states and 286245 transitions. [2024-11-07 00:03:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:03:04,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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 127 [2024-11-07 00:03:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:04,308 INFO L225 Difference]: With dead ends: 174951 [2024-11-07 00:03:04,308 INFO L226 Difference]: Without dead ends: 115337 [2024-11-07 00:03:04,353 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:03:04,354 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 423 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:04,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1693 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:03:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115337 states. [2024-11-07 00:03:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115337 to 115335. [2024-11-07 00:03:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115335 states, 115334 states have (on average 1.6199732949520522) internal successors, (186838), 115334 states have internal predecessors, (186838), 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:03:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115335 states to 115335 states and 186838 transitions. [2024-11-07 00:03:06,913 INFO L78 Accepts]: Start accepts. Automaton has 115335 states and 186838 transitions. Word has length 127 [2024-11-07 00:03:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:06,914 INFO L471 AbstractCegarLoop]: Abstraction has 115335 states and 186838 transitions. [2024-11-07 00:03:06,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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:03:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115335 states and 186838 transitions. [2024-11-07 00:03:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 00:03:06,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:06,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:06,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:03:06,915 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:06,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2084777501, now seen corresponding path program 1 times [2024-11-07 00:03:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497670127] [2024-11-07 00:03:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:07,454 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:03:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497670127] [2024-11-07 00:03:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497670127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:07,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:03:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993747661] [2024-11-07 00:03:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:03:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:03:07,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:07,457 INFO L87 Difference]: Start difference. First operand 115335 states and 186838 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 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:03:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:08,893 INFO L93 Difference]: Finished difference Result 121145 states and 194583 transitions. [2024-11-07 00:03:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:03:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 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:03:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:09,132 INFO L225 Difference]: With dead ends: 121145 [2024-11-07 00:03:09,133 INFO L226 Difference]: Without dead ends: 121143 [2024-11-07 00:03:09,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:03:09,176 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 0 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:09,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3082 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:03:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121143 states. [2024-11-07 00:03:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121143 to 121143. [2024-11-07 00:03:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121143 states, 121142 states have (on average 1.590026580376748) internal successors, (192619), 121142 states have internal predecessors, (192619), 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:03:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121143 states to 121143 states and 192619 transitions. [2024-11-07 00:03:11,405 INFO L78 Accepts]: Start accepts. Automaton has 121143 states and 192619 transitions. Word has length 128 [2024-11-07 00:03:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:11,406 INFO L471 AbstractCegarLoop]: Abstraction has 121143 states and 192619 transitions. [2024-11-07 00:03:11,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 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:03:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 121143 states and 192619 transitions. [2024-11-07 00:03:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:03:11,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:11,412 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:03:11,413 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1142768986, now seen corresponding path program 1 times [2024-11-07 00:03:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259713442] [2024-11-07 00:03:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:03:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259713442] [2024-11-07 00:03:11,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259713442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:11,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:11,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715028594] [2024-11-07 00:03:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:11,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:11,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:11,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:11,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:11,577 INFO L87 Difference]: Start difference. First operand 121143 states and 192619 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:03:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:13,997 INFO L93 Difference]: Finished difference Result 362408 states and 575834 transitions. [2024-11-07 00:03:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 163 [2024-11-07 00:03:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:14,434 INFO L225 Difference]: With dead ends: 362408 [2024-11-07 00:03:14,435 INFO L226 Difference]: Without dead ends: 241324 [2024-11-07 00:03:14,545 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:03:14,546 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 327 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:14,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1126 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241324 states. [2024-11-07 00:03:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241324 to 241322. [2024-11-07 00:03:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241322 states, 241321 states have (on average 1.579058598298532) internal successors, (381060), 241321 states have internal predecessors, (381060), 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:03:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241322 states to 241322 states and 381060 transitions. [2024-11-07 00:03:19,542 INFO L78 Accepts]: Start accepts. Automaton has 241322 states and 381060 transitions. Word has length 163 [2024-11-07 00:03:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:03:19,542 INFO L471 AbstractCegarLoop]: Abstraction has 241322 states and 381060 transitions. [2024-11-07 00:03:19,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:03:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 241322 states and 381060 transitions. [2024-11-07 00:03:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:03:19,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:03:19,557 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:03:19,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:03:19,558 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:03:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:03:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1467447441, now seen corresponding path program 1 times [2024-11-07 00:03:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:03:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509073272] [2024-11-07 00:03:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:03:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:03:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:03:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:03:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:03:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509073272] [2024-11-07 00:03:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509073272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:03:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:03:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:03:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868690604] [2024-11-07 00:03:19,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:03:19,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:03:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:03:19,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:03:19,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:03:19,714 INFO L87 Difference]: Start difference. First operand 241322 states and 381060 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:03:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:03:24,992 INFO L93 Difference]: Finished difference Result 721998 states and 1139269 transitions. [2024-11-07 00:03:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:03:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-07 00:03:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:03:26,407 INFO L225 Difference]: With dead ends: 721998 [2024-11-07 00:03:26,407 INFO L226 Difference]: Without dead ends: 480775 [2024-11-07 00:03:26,534 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:03:26,535 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 340 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:03:26,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1140 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:03:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480775 states.