./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label56.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/Problem12_label56.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', '2fec0dbf4b6ddb0b1603ab7a0ec8993384a9d6ffa347e857313f4dbf633d9cf3'] 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/Problem12_label56.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 2fec0dbf4b6ddb0b1603ab7a0ec8993384a9d6ffa347e857313f4dbf633d9cf3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:45:22,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:45:22,476 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:45:22,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:45:22,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:45:22,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:45:22,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:45:22,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:45:22,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:45:22,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:45:22,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:45:22,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:45:22,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:45:22,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:45:22,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:45:22,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:45:22,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:45:22,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:45:22,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:22,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:45:22,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:45:22,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:45:22,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:45:22,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:45:22,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:45:22,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:45:22,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:45:22,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:45:22,522 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 -> 2fec0dbf4b6ddb0b1603ab7a0ec8993384a9d6ffa347e857313f4dbf633d9cf3 [2024-11-06 19:45:22,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:45:22,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:45:22,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:45:22,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:45:22,839 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:45:22,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label56.c [2024-11-06 19:45:24,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:45:24,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:45:24,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label56.c [2024-11-06 19:45:24,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b345ca444/0bf35ff3ad4748458ab5c0404342c828/FLAGe35e85beb [2024-11-06 19:45:24,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b345ca444/0bf35ff3ad4748458ab5c0404342c828 [2024-11-06 19:45:24,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:45:24,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:45:24,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:24,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:45:24,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:45:24,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:24" (1/1) ... [2024-11-06 19:45:24,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6b9d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:24, skipping insertion in model container [2024-11-06 19:45:24,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:24" (1/1) ... [2024-11-06 19:45:24,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:45:25,140 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/Problem12_label56.c[6959,6972] [2024-11-06 19:45:25,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:25,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:45:25,803 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/Problem12_label56.c[6959,6972] [2024-11-06 19:45:26,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:26,167 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:45:26,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26 WrapperNode [2024-11-06 19:45:26,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:26,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:26,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:45:26,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:45:26,180 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:45:26" (1/1) ... [2024-11-06 19:45:26,239 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:45:26" (1/1) ... [2024-11-06 19:45:26,605 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:45:26,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:26,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:45:26,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:45:26,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:45:26,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:26,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:26,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:26,904 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:45:26,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:26,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:45:27,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:45:27,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:45:27,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:45:27,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (1/1) ... [2024-11-06 19:45:27,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:27,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:27,227 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:45:27,231 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:45:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:45:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:45:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:45:27,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:45:27,330 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:45:27,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:45:31,675 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:45:31,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:45:31,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:45:31,717 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:45:31,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:31 BoogieIcfgContainer [2024-11-06 19:45:31,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:45:31,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:45:31,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:45:31,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:45:31,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:45:24" (1/3) ... [2024-11-06 19:45:31,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1ad371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:31, skipping insertion in model container [2024-11-06 19:45:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:26" (2/3) ... [2024-11-06 19:45:31,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1ad371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:31, skipping insertion in model container [2024-11-06 19:45:31,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:31" (3/3) ... [2024-11-06 19:45:31,728 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label56.c [2024-11-06 19:45:31,741 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:45:31,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:45:31,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:45:31,833 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3795d8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:45:31,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:45:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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:45:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 19:45:31,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:31,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:31,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2024-11-06 19:45:31,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:31,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138905629] [2024-11-06 19:45:31,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:32,376 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:45:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:32,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138905629] [2024-11-06 19:45:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138905629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485244435] [2024-11-06 19:45:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:32,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:32,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:32,407 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:45:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:37,955 INFO L93 Difference]: Finished difference Result 3155 states and 6150 transitions. [2024-11-06 19:45:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 19:45:37,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-06 19:45:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:37,979 INFO L225 Difference]: With dead ends: 3155 [2024-11-06 19:45:37,979 INFO L226 Difference]: Without dead ends: 2265 [2024-11-06 19:45:37,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:37,988 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 2384 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:37,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 234 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-06 19:45:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-06 19:45:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2257. [2024-11-06 19:45:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5350177304964538) internal successors, (3463), 2256 states have internal predecessors, (3463), 0 states have call successors, (0), 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:45:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3463 transitions. [2024-11-06 19:45:38,102 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3463 transitions. Word has length 56 [2024-11-06 19:45:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:38,103 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3463 transitions. [2024-11-06 19:45:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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:45:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3463 transitions. [2024-11-06 19:45:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-06 19:45:38,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:38,108 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:38,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:45:38,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 32804695, now seen corresponding path program 1 times [2024-11-06 19:45:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704155816] [2024-11-06 19:45:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 19:45:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704155816] [2024-11-06 19:45:38,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704155816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:38,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:38,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294007121] [2024-11-06 19:45:38,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:38,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:38,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:38,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:38,669 INFO L87 Difference]: Start difference. First operand 2257 states and 3463 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:45:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:42,218 INFO L93 Difference]: Finished difference Result 6051 states and 9664 transitions. [2024-11-06 19:45:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:42,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 196 [2024-11-06 19:45:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:42,233 INFO L225 Difference]: With dead ends: 6051 [2024-11-06 19:45:42,234 INFO L226 Difference]: Without dead ends: 3759 [2024-11-06 19:45:42,237 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:45:42,238 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:42,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:45:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-06 19:45:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-06 19:45:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3408728046833422) internal successors, (5039), 3758 states have internal predecessors, (5039), 0 states have call successors, (0), 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:45:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5039 transitions. [2024-11-06 19:45:42,310 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5039 transitions. Word has length 196 [2024-11-06 19:45:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5039 transitions. [2024-11-06 19:45:42,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:45:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5039 transitions. [2024-11-06 19:45:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-06 19:45:42,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:42,318 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:42,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:45:42,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:42,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:42,323 INFO L85 PathProgramCache]: Analyzing trace with hash -930478554, now seen corresponding path program 1 times [2024-11-06 19:45:42,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900145634] [2024-11-06 19:45:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:45:42,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:42,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900145634] [2024-11-06 19:45:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900145634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:42,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523481903] [2024-11-06 19:45:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:42,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:42,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:42,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:42,651 INFO L87 Difference]: Start difference. First operand 3759 states and 5039 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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:45:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:45,064 INFO L93 Difference]: Finished difference Result 10520 states and 14356 transitions. [2024-11-06 19:45:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 266 [2024-11-06 19:45:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:45,088 INFO L225 Difference]: With dead ends: 10520 [2024-11-06 19:45:45,088 INFO L226 Difference]: Without dead ends: 6763 [2024-11-06 19:45:45,094 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:45:45,095 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:45,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 486 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-06 19:45:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6012. [2024-11-06 19:45:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2814839460988188) internal successors, (7703), 6011 states have internal predecessors, (7703), 0 states have call successors, (0), 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:45:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7703 transitions. [2024-11-06 19:45:45,237 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7703 transitions. Word has length 266 [2024-11-06 19:45:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:45,238 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7703 transitions. [2024-11-06 19:45:45,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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:45:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7703 transitions. [2024-11-06 19:45:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-06 19:45:45,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:45,242 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:45:45,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:45,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash 350397473, now seen corresponding path program 1 times [2024-11-06 19:45:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:45,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086648510] [2024-11-06 19:45:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:45,699 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 107 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-06 19:45:45,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:45,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086648510] [2024-11-06 19:45:45,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086648510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:45:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322789307] [2024-11-06 19:45:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:45,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:45,703 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:45:45,705 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:45:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:45,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:45:45,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:45:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:46,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:45:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322789307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:45:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 19:45:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546494374] [2024-11-06 19:45:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:46,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:46,313 INFO L87 Difference]: Start difference. First operand 6012 states and 7703 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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:45:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:48,703 INFO L93 Difference]: Finished difference Result 15026 states and 19934 transitions. [2024-11-06 19:45:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2024-11-06 19:45:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:48,726 INFO L225 Difference]: With dead ends: 15026 [2024-11-06 19:45:48,726 INFO L226 Difference]: Without dead ends: 9016 [2024-11-06 19:45:48,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 278 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:45:48,734 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 908 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:48,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9016 states. [2024-11-06 19:45:48,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 9016. [2024-11-06 19:45:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2657792567942319) internal successors, (11411), 9015 states have internal predecessors, (11411), 0 states have call successors, (0), 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:45:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 11411 transitions. [2024-11-06 19:45:48,893 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 11411 transitions. Word has length 279 [2024-11-06 19:45:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:48,894 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 11411 transitions. [2024-11-06 19:45:48,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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:45:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 11411 transitions. [2024-11-06 19:45:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-06 19:45:48,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:48,898 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:48,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 19:45:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:49,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2123466661, now seen corresponding path program 1 times [2024-11-06 19:45:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378254675] [2024-11-06 19:45:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 19:45:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378254675] [2024-11-06 19:45:49,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378254675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:49,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:49,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:49,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747891565] [2024-11-06 19:45:49,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:49,402 INFO L87 Difference]: Start difference. First operand 9016 states and 11411 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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:45:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:52,051 INFO L93 Difference]: Finished difference Result 21785 states and 27827 transitions. [2024-11-06 19:45:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:52,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 296 [2024-11-06 19:45:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:52,082 INFO L225 Difference]: With dead ends: 21785 [2024-11-06 19:45:52,082 INFO L226 Difference]: Without dead ends: 12771 [2024-11-06 19:45:52,088 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:45:52,089 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 719 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:52,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1216 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:45:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2024-11-06 19:45:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12771. [2024-11-06 19:45:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.183868441660141) internal successors, (15118), 12770 states have internal predecessors, (15118), 0 states have call successors, (0), 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:45:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15118 transitions. [2024-11-06 19:45:52,281 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15118 transitions. Word has length 296 [2024-11-06 19:45:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:52,281 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15118 transitions. [2024-11-06 19:45:52,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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:45:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15118 transitions. [2024-11-06 19:45:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-06 19:45:52,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:52,289 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45:52,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:45:52,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:52,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1096817930, now seen corresponding path program 1 times [2024-11-06 19:45:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:52,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787384828] [2024-11-06 19:45:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-06 19:45:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787384828] [2024-11-06 19:45:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787384828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494225321] [2024-11-06 19:45:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:52,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:52,624 INFO L87 Difference]: Start difference. First operand 12771 states and 15118 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:45:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:55,218 INFO L93 Difference]: Finished difference Result 36054 states and 43062 transitions. [2024-11-06 19:45:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 383 [2024-11-06 19:45:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:55,263 INFO L225 Difference]: With dead ends: 36054 [2024-11-06 19:45:55,263 INFO L226 Difference]: Without dead ends: 23285 [2024-11-06 19:45:55,277 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:45:55,279 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 639 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:55,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1223 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:45:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2024-11-06 19:45:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 22534. [2024-11-06 19:45:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1720143789109307) internal successors, (26409), 22533 states have internal predecessors, (26409), 0 states have call successors, (0), 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:45:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 26409 transitions. [2024-11-06 19:45:55,616 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 26409 transitions. Word has length 383 [2024-11-06 19:45:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:55,618 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 26409 transitions. [2024-11-06 19:45:55,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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:45:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 26409 transitions. [2024-11-06 19:45:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2024-11-06 19:45:55,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:55,638 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45:55,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:45:55,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1701463168, now seen corresponding path program 1 times [2024-11-06 19:45:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323049048] [2024-11-06 19:45:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 19:45:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323049048] [2024-11-06 19:45:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323049048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279392099] [2024-11-06 19:45:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:56,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:56,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:56,300 INFO L87 Difference]: Start difference. First operand 22534 states and 26409 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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:45:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:58,731 INFO L93 Difference]: Finished difference Result 51074 states and 59608 transitions. [2024-11-06 19:45:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 387 [2024-11-06 19:45:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:58,800 INFO L225 Difference]: With dead ends: 51074 [2024-11-06 19:45:58,801 INFO L226 Difference]: Without dead ends: 28542 [2024-11-06 19:45:58,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:45:58,830 INFO L432 NwaCegarLoop]: 961 mSDtfsCounter, 784 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:58,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 969 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2024-11-06 19:45:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 27040. [2024-11-06 19:45:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.144716890417545) internal successors, (30952), 27039 states have internal predecessors, (30952), 0 states have call successors, (0), 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:45:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30952 transitions. [2024-11-06 19:45:59,362 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30952 transitions. Word has length 387 [2024-11-06 19:45:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30952 transitions. [2024-11-06 19:45:59,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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:45:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30952 transitions. [2024-11-06 19:45:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-11-06 19:45:59,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:59,377 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:45:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:45:59,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash -351354421, now seen corresponding path program 1 times [2024-11-06 19:45:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:59,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866263358] [2024-11-06 19:45:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 19:45:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866263358] [2024-11-06 19:45:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866263358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:59,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132972994] [2024-11-06 19:45:59,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:59,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:59,688 INFO L87 Difference]: Start difference. First operand 27040 states and 30952 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:46:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:02,245 INFO L93 Difference]: Finished difference Result 54829 states and 62659 transitions. [2024-11-06 19:46:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 489 [2024-11-06 19:46:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:02,279 INFO L225 Difference]: With dead ends: 54829 [2024-11-06 19:46:02,280 INFO L226 Difference]: Without dead ends: 27791 [2024-11-06 19:46:02,297 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:46:02,297 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:02,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 269 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27791 states. [2024-11-06 19:46:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27791 to 27040. [2024-11-06 19:46:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.1338437072376937) internal successors, (30658), 27039 states have internal predecessors, (30658), 0 states have call successors, (0), 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:46:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30658 transitions. [2024-11-06 19:46:02,570 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30658 transitions. Word has length 489 [2024-11-06 19:46:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30658 transitions. [2024-11-06 19:46:02,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:46:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30658 transitions. [2024-11-06 19:46:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-11-06 19:46:02,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:02,581 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:02,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:46:02,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 99415947, now seen corresponding path program 1 times [2024-11-06 19:46:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080320555] [2024-11-06 19:46:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 396 proven. 230 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 19:46:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080320555] [2024-11-06 19:46:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080320555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:46:03,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651498547] [2024-11-06 19:46:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:03,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:46:03,113 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:46:03,115 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:46:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:03,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:46:03,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:46:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 19:46:03,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:46:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651498547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:46:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:46:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321496605] [2024-11-06 19:46:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:03,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:46:03,511 INFO L87 Difference]: Start difference. First operand 27040 states and 30658 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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:46:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:06,337 INFO L93 Difference]: Finished difference Result 72102 states and 82464 transitions. [2024-11-06 19:46:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 500 [2024-11-06 19:46:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:06,398 INFO L225 Difference]: With dead ends: 72102 [2024-11-06 19:46:06,399 INFO L226 Difference]: Without dead ends: 45064 [2024-11-06 19:46:06,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:46:06,428 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 665 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:06,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1053 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:46:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45064 states. [2024-11-06 19:46:06,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45064 to 45064. [2024-11-06 19:46:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.141291081374964) internal successors, (51430), 45063 states have internal predecessors, (51430), 0 states have call successors, (0), 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:46:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 51430 transitions. [2024-11-06 19:46:06,934 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 51430 transitions. Word has length 500 [2024-11-06 19:46:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 51430 transitions. [2024-11-06 19:46:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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:46:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 51430 transitions. [2024-11-06 19:46:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-11-06 19:46:06,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:06,949 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:06,966 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:46:07,149 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:46:07,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1198195645, now seen corresponding path program 1 times [2024-11-06 19:46:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932052658] [2024-11-06 19:46:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-06 19:46:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932052658] [2024-11-06 19:46:07,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932052658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:07,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:07,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111310385] [2024-11-06 19:46:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:07,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:07,518 INFO L87 Difference]: Start difference. First operand 45064 states and 51430 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:46:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:09,897 INFO L93 Difference]: Finished difference Result 107399 states and 121876 transitions. [2024-11-06 19:46:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 509 [2024-11-06 19:46:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:09,957 INFO L225 Difference]: With dead ends: 107399 [2024-11-06 19:46:09,958 INFO L226 Difference]: Without dead ends: 61586 [2024-11-06 19:46:09,992 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:46:09,992 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 732 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:09,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1074 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:46:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2024-11-06 19:46:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 55578. [2024-11-06 19:46:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55578 states, 55577 states have (on average 1.1048275365708837) internal successors, (61403), 55577 states have internal predecessors, (61403), 0 states have call successors, (0), 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:46:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 61403 transitions. [2024-11-06 19:46:10,579 INFO L78 Accepts]: Start accepts. Automaton has 55578 states and 61403 transitions. Word has length 509 [2024-11-06 19:46:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:10,579 INFO L471 AbstractCegarLoop]: Abstraction has 55578 states and 61403 transitions. [2024-11-06 19:46:10,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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:46:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55578 states and 61403 transitions. [2024-11-06 19:46:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-11-06 19:46:10,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:10,589 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:10,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:46:10,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1423184407, now seen corresponding path program 1 times [2024-11-06 19:46:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937393049] [2024-11-06 19:46:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 19:46:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937393049] [2024-11-06 19:46:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937393049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:10,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285429168] [2024-11-06 19:46:10,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:10,869 INFO L87 Difference]: Start difference. First operand 55578 states and 61403 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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:46:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:13,763 INFO L93 Difference]: Finished difference Result 144198 states and 159788 transitions. [2024-11-06 19:46:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 560 [2024-11-06 19:46:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:13,851 INFO L225 Difference]: With dead ends: 144198 [2024-11-06 19:46:13,851 INFO L226 Difference]: Without dead ends: 89373 [2024-11-06 19:46:13,888 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:46:13,889 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 617 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:13,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 461 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:46:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89373 states. [2024-11-06 19:46:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89373 to 87120. [2024-11-06 19:46:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87120 states, 87119 states have (on average 1.0904280352161986) internal successors, (94997), 87119 states have internal predecessors, (94997), 0 states have call successors, (0), 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:46:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87120 states to 87120 states and 94997 transitions. [2024-11-06 19:46:14,939 INFO L78 Accepts]: Start accepts. Automaton has 87120 states and 94997 transitions. Word has length 560 [2024-11-06 19:46:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:14,939 INFO L471 AbstractCegarLoop]: Abstraction has 87120 states and 94997 transitions. [2024-11-06 19:46:14,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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:46:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 87120 states and 94997 transitions. [2024-11-06 19:46:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-11-06 19:46:14,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:14,963 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:46:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:46:14,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash 526767637, now seen corresponding path program 1 times [2024-11-06 19:46:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994119626] [2024-11-06 19:46:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-06 19:46:15,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994119626] [2024-11-06 19:46:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994119626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:15,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370026757] [2024-11-06 19:46:15,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:15,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:15,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:15,557 INFO L87 Difference]: Start difference. First operand 87120 states and 94997 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:46:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:18,421 INFO L93 Difference]: Finished difference Result 193764 states and 211555 transitions. [2024-11-06 19:46:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 572 [2024-11-06 19:46:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:18,563 INFO L225 Difference]: With dead ends: 193764 [2024-11-06 19:46:18,564 INFO L226 Difference]: Without dead ends: 107397 [2024-11-06 19:46:18,599 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:46:18,601 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 583 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:18,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1288 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2024-11-06 19:46:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 104393. [2024-11-06 19:46:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104393 states, 104392 states have (on average 1.0831864510690474) internal successors, (113076), 104392 states have internal predecessors, (113076), 0 states have call successors, (0), 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:46:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104393 states to 104393 states and 113076 transitions. [2024-11-06 19:46:19,785 INFO L78 Accepts]: Start accepts. Automaton has 104393 states and 113076 transitions. Word has length 572 [2024-11-06 19:46:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 104393 states and 113076 transitions. [2024-11-06 19:46:19,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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:46:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 104393 states and 113076 transitions. [2024-11-06 19:46:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2024-11-06 19:46:19,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:19,827 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, 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, 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, 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] [2024-11-06 19:46:19,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:46:19,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:19,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2096031466, now seen corresponding path program 1 times [2024-11-06 19:46:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843617302] [2024-11-06 19:46:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1604 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2024-11-06 19:46:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843617302] [2024-11-06 19:46:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843617302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752745123] [2024-11-06 19:46:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:20,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:20,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:20,475 INFO L87 Difference]: Start difference. First operand 104393 states and 113076 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:46:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:22,987 INFO L93 Difference]: Finished difference Result 208782 states and 226253 transitions. [2024-11-06 19:46:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 815 [2024-11-06 19:46:22,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:22,989 INFO L225 Difference]: With dead ends: 208782 [2024-11-06 19:46:22,989 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:46:23,047 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:46:23,047 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 687 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:23,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1113 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:46:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:46:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:46:23,048 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:46:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:46:23,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 815 [2024-11-06 19:46:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:23,048 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:46:23,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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:46:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:46:23,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:46:23,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:46:23,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:46:23,054 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:23,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:46:25,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:46:25,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:46:25 BoogieIcfgContainer [2024-11-06 19:46:25,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:46:25,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:46:25,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:46:25,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:46:25,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:31" (3/4) ... [2024-11-06 19:46:25,331 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:46:25,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-06 19:46:25,386 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:46:25,390 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:46:25,393 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:46:25,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:46:25,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:46:25,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:46:25,684 INFO L158 Benchmark]: Toolchain (without parser) took 60910.22ms. Allocated memory was 100.7MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 63.2MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-06 19:46:25,684 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:46:25,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1396.84ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 63.0MB in the beginning and 101.5MB in the end (delta: -38.4MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-11-06 19:46:25,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 432.23ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 55.1MB in the end (delta: 46.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2024-11-06 19:46:25,685 INFO L158 Benchmark]: Boogie Preprocessor took 584.54ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 55.1MB in the beginning and 246.5MB in the end (delta: -191.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2024-11-06 19:46:25,685 INFO L158 Benchmark]: RCFGBuilder took 4526.48ms. Allocated memory is still 369.1MB. Free memory was 246.5MB in the beginning and 131.6MB in the end (delta: 114.9MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. [2024-11-06 19:46:25,687 INFO L158 Benchmark]: TraceAbstraction took 53606.61ms. Allocated memory was 369.1MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 131.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-06 19:46:25,687 INFO L158 Benchmark]: Witness Printer took 355.18ms. Allocated memory is still 3.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 54.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-06 19:46:25,690 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.23ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1396.84ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 63.0MB in the beginning and 101.5MB in the end (delta: -38.4MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 432.23ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 55.1MB in the end (delta: 46.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 584.54ms. Allocated memory was 159.4MB in the beginning and 369.1MB in the end (delta: 209.7MB). Free memory was 55.1MB in the beginning and 246.5MB in the end (delta: -191.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * RCFGBuilder took 4526.48ms. Allocated memory is still 369.1MB. Free memory was 246.5MB in the beginning and 131.6MB in the end (delta: 114.9MB). Peak memory consumption was 217.3MB. Max. memory is 16.1GB. * TraceAbstraction took 53606.61ms. Allocated memory was 369.1MB in the beginning and 3.9GB in the end (delta: 3.6GB). Free memory was 131.6MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 355.18ms. Allocated memory is still 3.9GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 54.2MB). Peak memory consumption was 50.3MB. 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: 190]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.3s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10752 SdHoareTripleChecker+Valid, 34.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10752 mSDsluCounter, 10403 SdHoareTripleChecker+Invalid, 28.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 8884 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31441 IncrementalHoareTripleChecker+Invalid, 40325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8884 mSolverCounterUnsat, 10286 mSDtfsCounter, 31441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104393occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 15028 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6087 NumberOfCodeBlocks, 6087 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6072 ConstructedInterpolants, 0 QuantifiedInterpolants, 15129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 7573/7857 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: 4828]: Loop Invariant Derived loop invariant: ((((((((((((a7 <= 13) && (5 == a5)) || (((0 <= ((long long) a17 + 107)) && (a2 <= 189)) && (a17 <= 111))) || (((a2 <= 170) && (a7 == 13)) && (((long long) a17 + 124) <= 0))) || ((a5 != 4) && (a2 <= 189))) || (((0 <= ((long long) a17 + 107)) && (a2 <= 189)) && (a24 != 14))) || (((a24 <= 14) && (14 <= a7)) && (a2 <= 189))) || (((a24 <= 14) && (256 <= a17)) && (a24 != 14))) || ((a24 <= 14) && (5 == a5))) || (((a24 <= 14) && (14 <= a7)) && (a24 != 14))) || (((a24 <= 14) && (a17 <= 111)) && (a24 != 14))) || ((a5 <= 4) && (190 <= a2))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:46:25,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE