./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label53.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/eca-rers2012/Problem15_label53.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', 'd47a87af871ac94bbcea7d3dd980f2dd1a9893e716b88333a075adbedab63554'] 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/eca-rers2012/Problem15_label53.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 d47a87af871ac94bbcea7d3dd980f2dd1a9893e716b88333a075adbedab63554 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:58:59,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:58:59,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:58:59,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:58:59,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:58:59,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:58:59,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:58:59,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:58:59,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:58:59,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:58:59,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:58:59,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:58:59,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:58:59,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:58:59,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:58:59,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:58:59,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:58:59,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:58:59,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:58:59,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:58:59,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:58:59,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:58:59,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:58:59,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:58:59,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:58:59,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:58:59,210 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 -> d47a87af871ac94bbcea7d3dd980f2dd1a9893e716b88333a075adbedab63554 [2024-11-06 19:58:59,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:58:59,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:58:59,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:58:59,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:58:59,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:58:59,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label53.c [2024-11-06 19:59:00,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:59:01,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:59:01,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label53.c [2024-11-06 19:59:01,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c6f04e12/40019e17071c4d4c94e9c6849014fe37/FLAG348d5c205 [2024-11-06 19:59:01,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0c6f04e12/40019e17071c4d4c94e9c6849014fe37 [2024-11-06 19:59:01,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:59:01,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:59:01,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:59:01,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:59:01,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:59:01,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:01" (1/1) ... [2024-11-06 19:59:01,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de45e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:01, skipping insertion in model container [2024-11-06 19:59:01,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:59:01" (1/1) ... [2024-11-06 19:59:01,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:59:01,514 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/eca-rers2012/Problem15_label53.c[5826,5839] [2024-11-06 19:59:01,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:59:01,827 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:59:01,850 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/eca-rers2012/Problem15_label53.c[5826,5839] [2024-11-06 19:59:02,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:59:02,054 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:59:02,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02 WrapperNode [2024-11-06 19:59:02,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:59:02,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:59:02,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:59:02,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:59:02,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,287 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:59:02,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:59:02,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:59:02,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:59:02,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:59:02,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,449 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-06 19:59:02,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,536 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:59:02,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:59:02,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:59:02,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:59:02,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (1/1) ... [2024-11-06 19:59:02,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:59:02,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:59:02,715 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-06 19:59:02,718 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-06 19:59:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:59:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:59:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:59:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:59:02,813 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:59:02,815 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:59:05,337 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:59:05,337 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:59:05,365 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:59:05,366 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:59:05,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:05 BoogieIcfgContainer [2024-11-06 19:59:05,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:59:05,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:59:05,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:59:05,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:59:05,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:59:01" (1/3) ... [2024-11-06 19:59:05,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fbd9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:05, skipping insertion in model container [2024-11-06 19:59:05,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:59:02" (2/3) ... [2024-11-06 19:59:05,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fbd9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:59:05, skipping insertion in model container [2024-11-06 19:59:05,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:05" (3/3) ... [2024-11-06 19:59:05,376 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label53.c [2024-11-06 19:59:05,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:59:05,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:59:05,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:59:05,469 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;@2c5d4765, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:59:05,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:59:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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-06 19:59:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 19:59:05,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:05,488 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] [2024-11-06 19:59:05,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2024-11-06 19:59:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:05,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292288893] [2024-11-06 19:59:05,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:05,851 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-06 19:59:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:05,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292288893] [2024-11-06 19:59:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292288893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:59:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536015812] [2024-11-06 19:59:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:05,881 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-06 19:59:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:07,967 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-06 19:59:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2024-11-06 19:59:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:07,985 INFO L225 Difference]: With dead ends: 1154 [2024-11-06 19:59:07,985 INFO L226 Difference]: Without dead ends: 665 [2024-11-06 19:59:07,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:59:07,995 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 274 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:07,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:59:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-06 19:59:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-06 19:59:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 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-06 19:59:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-06 19:59:08,067 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 47 [2024-11-06 19:59:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:08,068 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-06 19:59:08,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-06 19:59:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-06 19:59:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 19:59:08,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:08,073 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:59:08,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1438862921, now seen corresponding path program 1 times [2024-11-06 19:59:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300384073] [2024-11-06 19:59:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:59:08,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:08,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300384073] [2024-11-06 19:59:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300384073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:08,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:08,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:59:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247291601] [2024-11-06 19:59:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:08,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:08,581 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-06 19:59:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:09,969 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-06 19:59:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:09,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-06 19:59:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:09,973 INFO L225 Difference]: With dead ends: 1624 [2024-11-06 19:59:09,974 INFO L226 Difference]: Without dead ends: 963 [2024-11-06 19:59:09,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:59:09,976 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:09,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:59:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-06 19:59:09,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-06 19:59:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 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-06 19:59:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-06 19:59:10,009 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 112 [2024-11-06 19:59:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:10,009 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-06 19:59:10,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-06 19:59:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-06 19:59:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 19:59:10,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:10,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:10,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:59:10,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:10,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2089662630, now seen corresponding path program 1 times [2024-11-06 19:59:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:10,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396771777] [2024-11-06 19:59:10,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:59:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:10,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396771777] [2024-11-06 19:59:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396771777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:59:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54451500] [2024-11-06 19:59:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:10,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:10,189 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-06 19:59:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:11,668 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-06 19:59:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2024-11-06 19:59:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:11,675 INFO L225 Difference]: With dead ends: 2229 [2024-11-06 19:59:11,675 INFO L226 Difference]: Without dead ends: 1567 [2024-11-06 19:59:11,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:59:11,677 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:11,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 318 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:59:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-06 19:59:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-06 19:59:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 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-06 19:59:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2024-11-06 19:59:11,705 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 117 [2024-11-06 19:59:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2024-11-06 19:59:11,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-06 19:59:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2024-11-06 19:59:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-06 19:59:11,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:11,711 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:59:11,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:59:11,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:11,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 864549314, now seen corresponding path program 1 times [2024-11-06 19:59:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403967198] [2024-11-06 19:59:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:59:12,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403967198] [2024-11-06 19:59:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403967198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416048296] [2024-11-06 19:59:12,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:59:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:12,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:59:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:59:12,033 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-06 19:59:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:14,923 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2024-11-06 19:59:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:59:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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 213 [2024-11-06 19:59:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:14,936 INFO L225 Difference]: With dead ends: 4668 [2024-11-06 19:59:14,936 INFO L226 Difference]: Without dead ends: 3404 [2024-11-06 19:59:14,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:59:14,940 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 484 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:14,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 377 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:59:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2024-11-06 19:59:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2024-11-06 19:59:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 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-06 19:59:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2024-11-06 19:59:15,004 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 213 [2024-11-06 19:59:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:15,005 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2024-11-06 19:59:15,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-06 19:59:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2024-11-06 19:59:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-06 19:59:15,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:15,009 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:59:15,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:59:15,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:15,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash 154363468, now seen corresponding path program 1 times [2024-11-06 19:59:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:15,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199060069] [2024-11-06 19:59:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:59:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199060069] [2024-11-06 19:59:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199060069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:59:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422760750] [2024-11-06 19:59:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:15,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:15,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:15,222 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-06 19:59:16,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:16,560 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2024-11-06 19:59:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:16,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-11-06 19:59:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:16,578 INFO L225 Difference]: With dead ends: 8563 [2024-11-06 19:59:16,578 INFO L226 Difference]: Without dead ends: 5483 [2024-11-06 19:59:16,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:59:16,583 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:16,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:59:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-06 19:59:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-06 19:59:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 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-06 19:59:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2024-11-06 19:59:16,685 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 217 [2024-11-06 19:59:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:16,686 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2024-11-06 19:59:16,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-06 19:59:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2024-11-06 19:59:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-06 19:59:16,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:16,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:59:16,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:59:16,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1951907684, now seen corresponding path program 1 times [2024-11-06 19:59:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746927073] [2024-11-06 19:59:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 19:59:17,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746927073] [2024-11-06 19:59:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746927073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:59:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811434819] [2024-11-06 19:59:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:17,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:17,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:17,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:17,421 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-06 19:59:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:18,522 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2024-11-06 19:59:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:18,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 319 [2024-11-06 19:59:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:18,537 INFO L225 Difference]: With dead ends: 10655 [2024-11-06 19:59:18,537 INFO L226 Difference]: Without dead ends: 5478 [2024-11-06 19:59:18,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 19:59:18,545 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:18,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:59:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-06 19:59:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-06 19:59:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 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-06 19:59:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2024-11-06 19:59:18,641 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 319 [2024-11-06 19:59:18,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:18,642 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2024-11-06 19:59:18,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-06 19:59:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2024-11-06 19:59:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-06 19:59:18,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:18,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:59:18,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash 544636501, now seen corresponding path program 1 times [2024-11-06 19:59:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798740498] [2024-11-06 19:59:18,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:59:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:18,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798740498] [2024-11-06 19:59:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798740498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:18,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:18,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137955381] [2024-11-06 19:59:18,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:18,965 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-06 19:59:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:20,375 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2024-11-06 19:59:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 334 [2024-11-06 19:59:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:20,393 INFO L225 Difference]: With dead ends: 11851 [2024-11-06 19:59:20,393 INFO L226 Difference]: Without dead ends: 6674 [2024-11-06 19:59:20,397 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-06 19:59:20,397 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 268 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:20,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:59:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2024-11-06 19:59:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2024-11-06 19:59:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 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-06 19:59:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2024-11-06 19:59:20,483 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 334 [2024-11-06 19:59:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:20,484 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2024-11-06 19:59:20,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-06 19:59:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2024-11-06 19:59:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-06 19:59:20,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:20,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:59:20,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:59:20,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:20,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1192256238, now seen corresponding path program 1 times [2024-11-06 19:59:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:20,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739188256] [2024-11-06 19:59:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 89 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:59:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739188256] [2024-11-06 19:59:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739188256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:59:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678878430] [2024-11-06 19:59:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:21,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:21,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:59:21,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:59:21,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:59:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:21,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:59:21,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:59:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:59:22,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:59:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678878430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:22,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:59:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:59:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297162717] [2024-11-06 19:59:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:22,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:59:22,048 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-06 19:59:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:23,495 INFO L93 Difference]: Finished difference Result 10958 states and 13239 transitions. [2024-11-06 19:59:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2024-11-06 19:59:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:23,520 INFO L225 Difference]: With dead ends: 10958 [2024-11-06 19:59:23,521 INFO L226 Difference]: Without dead ends: 6682 [2024-11-06 19:59:23,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:59:23,526 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 249 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:23,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 345 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:59:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2024-11-06 19:59:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 6380. [2024-11-06 19:59:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.166483774886346) internal successors, (7441), 6379 states have internal predecessors, (7441), 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-06 19:59:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7441 transitions. [2024-11-06 19:59:23,621 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7441 transitions. Word has length 393 [2024-11-06 19:59:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:23,622 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7441 transitions. [2024-11-06 19:59:23,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-06 19:59:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7441 transitions. [2024-11-06 19:59:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-06 19:59:23,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:23,630 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:59:23,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:59:23,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:23,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1701542393, now seen corresponding path program 1 times [2024-11-06 19:59:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655559763] [2024-11-06 19:59:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 291 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 19:59:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655559763] [2024-11-06 19:59:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655559763] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:59:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740062537] [2024-11-06 19:59:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:24,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:59:24,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:59:24,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:59:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:24,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:59:24,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:59:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 291 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 19:59:25,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:59:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 291 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 19:59:26,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740062537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:59:26,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:59:26,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-06 19:59:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317921204] [2024-11-06 19:59:26,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:59:26,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:59:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:59:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:59:26,169 INFO L87 Difference]: Start difference. First operand 6380 states and 7441 transitions. Second operand has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 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-06 19:59:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:30,922 INFO L93 Difference]: Finished difference Result 18999 states and 21936 transitions. [2024-11-06 19:59:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 19:59:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 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 410 [2024-11-06 19:59:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:30,937 INFO L225 Difference]: With dead ends: 18999 [2024-11-06 19:59:30,937 INFO L226 Difference]: Without dead ends: 7278 [2024-11-06 19:59:30,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-06 19:59:30,944 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2891 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6135 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 6135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:30,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 286 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 6135 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-06 19:59:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2024-11-06 19:59:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 6677. [2024-11-06 19:59:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 1.1065008987417615) internal successors, (7387), 6676 states have internal predecessors, (7387), 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-06 19:59:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 7387 transitions. [2024-11-06 19:59:31,038 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 7387 transitions. Word has length 410 [2024-11-06 19:59:31,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:31,039 INFO L471 AbstractCegarLoop]: Abstraction has 6677 states and 7387 transitions. [2024-11-06 19:59:31,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 72.66666666666667) internal successors, (654), 8 states have internal predecessors, (654), 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-06 19:59:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 7387 transitions. [2024-11-06 19:59:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-06 19:59:31,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:31,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:59:31,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:59:31,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:31,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:31,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1911528904, now seen corresponding path program 1 times [2024-11-06 19:59:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180099764] [2024-11-06 19:59:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 19:59:31,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:31,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180099764] [2024-11-06 19:59:31,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180099764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:31,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:31,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:31,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125106309] [2024-11-06 19:59:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:31,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:31,723 INFO L87 Difference]: Start difference. First operand 6677 states and 7387 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-06 19:59:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:32,746 INFO L93 Difference]: Finished difference Result 15147 states and 16840 transitions. [2024-11-06 19:59:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 424 [2024-11-06 19:59:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:32,762 INFO L225 Difference]: With dead ends: 15147 [2024-11-06 19:59:32,762 INFO L226 Difference]: Without dead ends: 8472 [2024-11-06 19:59:32,767 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-06 19:59:32,768 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 278 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:32,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 549 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:59:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8472 states. [2024-11-06 19:59:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8472 to 8171. [2024-11-06 19:59:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8171 states, 8170 states have (on average 1.086046511627907) internal successors, (8873), 8170 states have internal predecessors, (8873), 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-06 19:59:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 8873 transitions. [2024-11-06 19:59:32,849 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 8873 transitions. Word has length 424 [2024-11-06 19:59:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:32,850 INFO L471 AbstractCegarLoop]: Abstraction has 8171 states and 8873 transitions. [2024-11-06 19:59:32,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-06 19:59:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 8873 transitions. [2024-11-06 19:59:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-06 19:59:32,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:32,855 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:59:32,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:59:32,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:32,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 25263887, now seen corresponding path program 1 times [2024-11-06 19:59:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277738646] [2024-11-06 19:59:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-06 19:59:33,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:33,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277738646] [2024-11-06 19:59:33,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277738646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:33,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:33,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:33,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349471743] [2024-11-06 19:59:33,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:33,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:33,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:33,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:33,160 INFO L87 Difference]: Start difference. First operand 8171 states and 8873 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-06 19:59:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:33,981 INFO L93 Difference]: Finished difference Result 16338 states and 17786 transitions. [2024-11-06 19:59:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:33,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 548 [2024-11-06 19:59:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:33,993 INFO L225 Difference]: With dead ends: 16338 [2024-11-06 19:59:33,993 INFO L226 Difference]: Without dead ends: 8468 [2024-11-06 19:59:33,999 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-06 19:59:34,000 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 438 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:34,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 70 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:59:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8468 states. [2024-11-06 19:59:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8468 to 8169. [2024-11-06 19:59:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8168 states have (on average 1.085822722820764) internal successors, (8869), 8168 states have internal predecessors, (8869), 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-06 19:59:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 8869 transitions. [2024-11-06 19:59:34,078 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 8869 transitions. Word has length 548 [2024-11-06 19:59:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 8869 transitions. [2024-11-06 19:59:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-06 19:59:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 8869 transitions. [2024-11-06 19:59:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-11-06 19:59:34,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:34,084 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:34,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:59:34,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:34,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1980825658, now seen corresponding path program 1 times [2024-11-06 19:59:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:34,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23151399] [2024-11-06 19:59:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:34,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-06 19:59:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:34,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23151399] [2024-11-06 19:59:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23151399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:34,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776896709] [2024-11-06 19:59:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:34,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:34,551 INFO L87 Difference]: Start difference. First operand 8169 states and 8869 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:35,429 INFO L93 Difference]: Finished difference Result 19054 states and 20734 transitions. [2024-11-06 19:59:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 574 [2024-11-06 19:59:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:35,444 INFO L225 Difference]: With dead ends: 19054 [2024-11-06 19:59:35,444 INFO L226 Difference]: Without dead ends: 10887 [2024-11-06 19:59:35,452 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-06 19:59:35,452 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 290 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:35,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 250 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:59:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2024-11-06 19:59:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 8471. [2024-11-06 19:59:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8471 states, 8470 states have (on average 1.084297520661157) internal successors, (9184), 8470 states have internal predecessors, (9184), 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-06 19:59:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8471 states to 8471 states and 9184 transitions. [2024-11-06 19:59:35,582 INFO L78 Accepts]: Start accepts. Automaton has 8471 states and 9184 transitions. Word has length 574 [2024-11-06 19:59:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:35,583 INFO L471 AbstractCegarLoop]: Abstraction has 8471 states and 9184 transitions. [2024-11-06 19:59:35,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8471 states and 9184 transitions. [2024-11-06 19:59:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-06 19:59:35,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:35,601 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:35,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:59:35,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:35,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1516385307, now seen corresponding path program 1 times [2024-11-06 19:59:35,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:35,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962998071] [2024-11-06 19:59:35,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:35,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-06 19:59:36,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962998071] [2024-11-06 19:59:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962998071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:36,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620707678] [2024-11-06 19:59:36,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:36,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:36,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:36,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:36,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:36,152 INFO L87 Difference]: Start difference. First operand 8471 states and 9184 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:36,937 INFO L93 Difference]: Finished difference Result 19630 states and 21365 transitions. [2024-11-06 19:59:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 582 [2024-11-06 19:59:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:36,951 INFO L225 Difference]: With dead ends: 19630 [2024-11-06 19:59:36,951 INFO L226 Difference]: Without dead ends: 11161 [2024-11-06 19:59:36,958 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-06 19:59:36,958 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 269 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:36,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 538 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:59:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2024-11-06 19:59:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 10563. [2024-11-06 19:59:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10563 states, 10562 states have (on average 1.0707252414315471) internal successors, (11309), 10562 states have internal predecessors, (11309), 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-06 19:59:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 11309 transitions. [2024-11-06 19:59:37,059 INFO L78 Accepts]: Start accepts. Automaton has 10563 states and 11309 transitions. Word has length 582 [2024-11-06 19:59:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:37,060 INFO L471 AbstractCegarLoop]: Abstraction has 10563 states and 11309 transitions. [2024-11-06 19:59:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10563 states and 11309 transitions. [2024-11-06 19:59:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-11-06 19:59:37,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:37,066 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:59:37,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:59:37,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:37,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash -533162390, now seen corresponding path program 1 times [2024-11-06 19:59:37,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:37,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204784104] [2024-11-06 19:59:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-11-06 19:59:37,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204784104] [2024-11-06 19:59:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204784104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:37,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:37,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413286797] [2024-11-06 19:59:37,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:37,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:37,333 INFO L87 Difference]: Start difference. First operand 10563 states and 11309 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:38,134 INFO L93 Difference]: Finished difference Result 23814 states and 25604 transitions. [2024-11-06 19:59:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:38,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 585 [2024-11-06 19:59:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:38,145 INFO L225 Difference]: With dead ends: 23814 [2024-11-06 19:59:38,146 INFO L226 Difference]: Without dead ends: 13253 [2024-11-06 19:59:38,153 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-06 19:59:38,153 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 298 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:38,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 466 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:59:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13253 states. [2024-11-06 19:59:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13253 to 13253. [2024-11-06 19:59:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13253 states, 13252 states have (on average 1.0642167220042258) internal successors, (14103), 13252 states have internal predecessors, (14103), 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-06 19:59:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 14103 transitions. [2024-11-06 19:59:38,311 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 14103 transitions. Word has length 585 [2024-11-06 19:59:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 13253 states and 14103 transitions. [2024-11-06 19:59:38,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-06 19:59:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 14103 transitions. [2024-11-06 19:59:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2024-11-06 19:59:38,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:38,322 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:38,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:59:38,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:38,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1380580974, now seen corresponding path program 1 times [2024-11-06 19:59:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479004895] [2024-11-06 19:59:38,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-06 19:59:38,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479004895] [2024-11-06 19:59:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479004895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:38,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996007290] [2024-11-06 19:59:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:38,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:38,976 INFO L87 Difference]: Start difference. First operand 13253 states and 14103 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-06 19:59:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:39,784 INFO L93 Difference]: Finished difference Result 28896 states and 30998 transitions. [2024-11-06 19:59:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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 737 [2024-11-06 19:59:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:39,801 INFO L225 Difference]: With dead ends: 28896 [2024-11-06 19:59:39,801 INFO L226 Difference]: Without dead ends: 15944 [2024-11-06 19:59:39,811 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-06 19:59:39,812 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 160 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:39,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 516 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:59:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15944 states. [2024-11-06 19:59:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15944 to 15645. [2024-11-06 19:59:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15645 states, 15644 states have (on average 1.0582331884428535) internal successors, (16555), 15644 states have internal predecessors, (16555), 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-06 19:59:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15645 states to 15645 states and 16555 transitions. [2024-11-06 19:59:39,952 INFO L78 Accepts]: Start accepts. Automaton has 15645 states and 16555 transitions. Word has length 737 [2024-11-06 19:59:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:39,953 INFO L471 AbstractCegarLoop]: Abstraction has 15645 states and 16555 transitions. [2024-11-06 19:59:39,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-06 19:59:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 15645 states and 16555 transitions. [2024-11-06 19:59:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2024-11-06 19:59:40,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:40,020 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:59:40,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:59:40,020 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash -517569305, now seen corresponding path program 1 times [2024-11-06 19:59:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281784152] [2024-11-06 19:59:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 872 proven. 345 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-06 19:59:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281784152] [2024-11-06 19:59:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281784152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:59:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951516851] [2024-11-06 19:59:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:41,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:59:41,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:59:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:59:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:41,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:59:41,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:59:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-11-06 19:59:41,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:59:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951516851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:59:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:59:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091683591] [2024-11-06 19:59:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:59:41,784 INFO L87 Difference]: Start difference. First operand 15645 states and 16555 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-06 19:59:42,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:42,485 INFO L93 Difference]: Finished difference Result 30691 states and 32505 transitions. [2024-11-06 19:59:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:42,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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 824 [2024-11-06 19:59:42,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:42,502 INFO L225 Difference]: With dead ends: 30691 [2024-11-06 19:59:42,502 INFO L226 Difference]: Without dead ends: 15347 [2024-11-06 19:59:42,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:59:42,511 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 219 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:42,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 397 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:59:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15347 states. [2024-11-06 19:59:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15347 to 15343. [2024-11-06 19:59:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15343 states, 15342 states have (on average 1.0517533567983315) internal successors, (16136), 15342 states have internal predecessors, (16136), 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-06 19:59:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 16136 transitions. [2024-11-06 19:59:42,649 INFO L78 Accepts]: Start accepts. Automaton has 15343 states and 16136 transitions. Word has length 824 [2024-11-06 19:59:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:42,649 INFO L471 AbstractCegarLoop]: Abstraction has 15343 states and 16136 transitions. [2024-11-06 19:59:42,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-06 19:59:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15343 states and 16136 transitions. [2024-11-06 19:59:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2024-11-06 19:59:42,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:42,659 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:42,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 19:59:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:59:42,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:42,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 799640595, now seen corresponding path program 1 times [2024-11-06 19:59:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:42,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968445953] [2024-11-06 19:59:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2024-11-06 19:59:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968445953] [2024-11-06 19:59:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968445953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574547945] [2024-11-06 19:59:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:43,490 INFO L87 Difference]: Start difference. First operand 15343 states and 16136 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-06 19:59:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:44,248 INFO L93 Difference]: Finished difference Result 30384 states and 31968 transitions. [2024-11-06 19:59:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:44,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 831 [2024-11-06 19:59:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:44,264 INFO L225 Difference]: With dead ends: 30384 [2024-11-06 19:59:44,264 INFO L226 Difference]: Without dead ends: 15043 [2024-11-06 19:59:44,274 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-06 19:59:44,275 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 279 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:44,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 501 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:59:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15043 states. [2024-11-06 19:59:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15043 to 14743. [2024-11-06 19:59:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14743 states, 14742 states have (on average 1.0356125356125356) internal successors, (15267), 14742 states have internal predecessors, (15267), 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-06 19:59:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14743 states to 14743 states and 15267 transitions. [2024-11-06 19:59:44,402 INFO L78 Accepts]: Start accepts. Automaton has 14743 states and 15267 transitions. Word has length 831 [2024-11-06 19:59:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:44,403 INFO L471 AbstractCegarLoop]: Abstraction has 14743 states and 15267 transitions. [2024-11-06 19:59:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-06 19:59:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14743 states and 15267 transitions. [2024-11-06 19:59:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2024-11-06 19:59:44,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:44,414 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:59:44,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:59:44,414 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:44,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1131307691, now seen corresponding path program 1 times [2024-11-06 19:59:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139796] [2024-11-06 19:59:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:44,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 756 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-11-06 19:59:45,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139796] [2024-11-06 19:59:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:45,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:45,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977156522] [2024-11-06 19:59:45,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:45,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:45,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:45,003 INFO L87 Difference]: Start difference. First operand 14743 states and 15267 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-06 19:59:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:45,826 INFO L93 Difference]: Finished difference Result 34879 states and 36113 transitions. [2024-11-06 19:59:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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 926 [2024-11-06 19:59:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:45,841 INFO L225 Difference]: With dead ends: 34879 [2024-11-06 19:59:45,842 INFO L226 Difference]: Without dead ends: 20437 [2024-11-06 19:59:45,851 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-06 19:59:45,851 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 270 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:45,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 140 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:59:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20437 states. [2024-11-06 19:59:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20437 to 16537. [2024-11-06 19:59:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16537 states, 16536 states have (on average 1.0357402031930334) internal successors, (17127), 16536 states have internal predecessors, (17127), 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-06 19:59:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16537 states to 16537 states and 17127 transitions. [2024-11-06 19:59:45,983 INFO L78 Accepts]: Start accepts. Automaton has 16537 states and 17127 transitions. Word has length 926 [2024-11-06 19:59:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:45,984 INFO L471 AbstractCegarLoop]: Abstraction has 16537 states and 17127 transitions. [2024-11-06 19:59:45,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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-06 19:59:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16537 states and 17127 transitions. [2024-11-06 19:59:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1603 [2024-11-06 19:59:46,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:59:46,003 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-06 19:59:46,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:59:46,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:59:46,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:59:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1985499588, now seen corresponding path program 1 times [2024-11-06 19:59:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:59:46,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571746589] [2024-11-06 19:59:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:59:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:59:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:59:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4626 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2024-11-06 19:59:46,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:59:46,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571746589] [2024-11-06 19:59:46,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571746589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:59:46,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:59:46,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:59:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745112715] [2024-11-06 19:59:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:59:46,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:59:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:59:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:59:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:59:46,899 INFO L87 Difference]: Start difference. First operand 16537 states and 17127 transitions. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-06 19:59:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:59:47,527 INFO L93 Difference]: Finished difference Result 27935 states and 28812 transitions. [2024-11-06 19:59:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:59:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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 1602 [2024-11-06 19:59:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:59:47,528 INFO L225 Difference]: With dead ends: 27935 [2024-11-06 19:59:47,528 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:59:47,537 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-06 19:59:47,538 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 72 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:59:47,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:59:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:59:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:59:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-06 19:59:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:59:47,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1602 [2024-11-06 19:59:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:59:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:59:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-06 19:59:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:59:47,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:59:47,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:59:47,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 19:59:47,548 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:59:47,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:59:48,651 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:59:48,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:59:48 BoogieIcfgContainer [2024-11-06 19:59:48,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:59:48,667 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:59:48,667 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:59:48,667 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:59:48,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:59:05" (3/4) ... [2024-11-06 19:59:48,669 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:59:48,693 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:59:48,695 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:59:48,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:59:48,698 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:59:48,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:59:48,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:59:48,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:59:48,889 INFO L158 Benchmark]: Toolchain (without parser) took 47608.29ms. Allocated memory was 100.7MB in the beginning and 645.9MB in the end (delta: 545.3MB). Free memory was 71.8MB in the beginning and 398.0MB in the end (delta: -326.3MB). Peak memory consumption was 210.8MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,889 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:59:48,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 774.54ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 61.5MB in the end (delta: 10.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.35ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 42.8MB in the end (delta: 18.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,891 INFO L158 Benchmark]: Boogie Preprocessor took 387.31ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 42.8MB in the beginning and 120.4MB in the end (delta: -77.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,892 INFO L158 Benchmark]: RCFGBuilder took 2689.16ms. Allocated memory is still 201.3MB. Free memory was 120.4MB in the beginning and 83.3MB in the end (delta: 37.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,892 INFO L158 Benchmark]: TraceAbstraction took 43297.79ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 83.3MB in the beginning and 418.9MB in the end (delta: -335.6MB). Peak memory consumption was 407.1MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,893 INFO L158 Benchmark]: Witness Printer took 220.09ms. Allocated memory is still 645.9MB. Free memory was 418.9MB in the beginning and 398.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:59:48,894 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 774.54ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 61.5MB in the end (delta: 10.1MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.35ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 42.8MB in the end (delta: 18.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 387.31ms. Allocated memory was 100.7MB in the beginning and 201.3MB in the end (delta: 100.7MB). Free memory was 42.8MB in the beginning and 120.4MB in the end (delta: -77.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2689.16ms. Allocated memory is still 201.3MB. Free memory was 120.4MB in the beginning and 83.3MB in the end (delta: 37.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * TraceAbstraction took 43297.79ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 83.3MB in the beginning and 418.9MB in the end (delta: -335.6MB). Peak memory consumption was 407.1MB. Max. memory is 16.1GB. * Witness Printer took 220.09ms. Allocated memory is still 645.9MB. Free memory was 418.9MB in the beginning and 398.0MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 158]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.1s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7594 SdHoareTripleChecker+Valid, 24.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7594 mSDsluCounter, 6607 SdHoareTripleChecker+Invalid, 20.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 3400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22148 IncrementalHoareTripleChecker+Invalid, 25548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3400 mSolverCounterUnsat, 5760 mSDtfsCounter, 22148 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2096 GetRequests, 2058 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16537occurred in iteration=18, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 11448 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 11422 NumberOfCodeBlocks, 11422 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 11809 ConstructedInterpolants, 0 QuantifiedInterpolants, 34273 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 14509/15046 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: ((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || (((((long long) a29 + 18) <= 0) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (((long long) a29 + 18) <= 0)) && (((long long) a0 + 61) <= 0))) || ((2 == a2) && (((long long) 98 + a0) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || (((5 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((a29 <= 41) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) || (((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((5 == a2) && (((long long) 89 + a4) <= 0))) || (((0 <= ((long long) a0 + 60)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || (((5 == a2) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (a2 <= 2))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || (((0 <= ((long long) a0 + 60)) && (((long long) a4 + 86) <= 0)) && (a2 == 4))) || ((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:59:48,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE