./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label26.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/Problem01_label26.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', '41fffd2e204f5953653ecd6a172157691ba74909e2a5ccd1b00c61b2b6a658af'] 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/Problem01_label26.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 41fffd2e204f5953653ecd6a172157691ba74909e2a5ccd1b00c61b2b6a658af --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:53:57,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:53:57,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:53:57,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:53:57,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:53:57,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:53:57,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:53:57,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:53:57,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:53:57,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:53:57,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:53:57,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:53:57,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:53:57,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:53:57,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:53:57,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:53:57,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:53:57,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:53:57,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:53:57,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:53:57,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:53:57,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:53:57,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:53:57,288 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 -> 41fffd2e204f5953653ecd6a172157691ba74909e2a5ccd1b00c61b2b6a658af [2024-11-06 18:53:57,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:53:57,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:53:57,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:53:57,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:53:57,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:53:57,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2024-11-06 18:53:58,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:53:59,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:53:59,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2024-11-06 18:53:59,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eddfb3503/9d53091e3d474496bec2a87f3170804a/FLAGf53f88c02 [2024-11-06 18:53:59,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eddfb3503/9d53091e3d474496bec2a87f3170804a [2024-11-06 18:53:59,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:53:59,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:53:59,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:53:59,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:53:59,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:53:59,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3041c3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59, skipping insertion in model container [2024-11-06 18:53:59,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:53:59,621 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/Problem01_label26.c[18357,18370] [2024-11-06 18:53:59,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:53:59,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:53:59,772 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/Problem01_label26.c[18357,18370] [2024-11-06 18:53:59,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:53:59,810 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:53:59,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59 WrapperNode [2024-11-06 18:53:59,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:53:59,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:53:59,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:53:59,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:53:59,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,934 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-11-06 18:53:59,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:53:59,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:53:59,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:53:59,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:53:59,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,997 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 18:53:59,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:53:59,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:54:00,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:54:00,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:54:00,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:54:00,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (1/1) ... [2024-11-06 18:54:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:54:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:54:00,115 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 18:54:00,123 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 18:54:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:54:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:54:00,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:54:00,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:54:00,194 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:54:00,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:54:00,940 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-06 18:54:00,941 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:54:00,950 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:54:00,951 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:54:00,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:00 BoogieIcfgContainer [2024-11-06 18:54:00,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:54:00,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:54:00,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:54:00,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:54:00,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:53:59" (1/3) ... [2024-11-06 18:54:00,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e254d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:00, skipping insertion in model container [2024-11-06 18:54:00,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:59" (2/3) ... [2024-11-06 18:54:00,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e254d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:54:00, skipping insertion in model container [2024-11-06 18:54:00,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:00" (3/3) ... [2024-11-06 18:54:00,958 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2024-11-06 18:54:00,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:54:00,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:54:01,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:54:01,028 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;@4923d27e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:54:01,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:54:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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 18:54:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-06 18:54:01,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:01,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:01,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2024-11-06 18:54:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:01,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360735710] [2024-11-06 18:54:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:01,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360735710] [2024-11-06 18:54:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360735710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116740952] [2024-11-06 18:54:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:01,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:01,539 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:54:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:02,182 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2024-11-06 18:54:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-06 18:54:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:02,195 INFO L225 Difference]: With dead ends: 528 [2024-11-06 18:54:02,196 INFO L226 Difference]: Without dead ends: 266 [2024-11-06 18:54:02,200 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 18:54:02,201 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:02,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 51 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:54:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-06 18:54:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-11-06 18:54:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4566037735849056) internal successors, (386), 265 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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 18:54:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 386 transitions. [2024-11-06 18:54:02,244 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 386 transitions. Word has length 103 [2024-11-06 18:54:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:02,244 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 386 transitions. [2024-11-06 18:54:02,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 18:54:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 386 transitions. [2024-11-06 18:54:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-06 18:54:02,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:02,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:02,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:54:02,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:02,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1946546597, now seen corresponding path program 1 times [2024-11-06 18:54:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:02,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950104471] [2024-11-06 18:54:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950104471] [2024-11-06 18:54:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950104471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:54:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564088827] [2024-11-06 18:54:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:02,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:02,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:02,350 INFO L87 Difference]: Start difference. First operand 266 states and 386 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:02,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:02,688 INFO L93 Difference]: Finished difference Result 792 states and 1153 transitions. [2024-11-06 18:54:02,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:02,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-06 18:54:02,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:02,691 INFO L225 Difference]: With dead ends: 792 [2024-11-06 18:54:02,691 INFO L226 Difference]: Without dead ends: 528 [2024-11-06 18:54:02,692 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 18:54:02,692 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:02,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-06 18:54:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2024-11-06 18:54:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3795066413662238) internal successors, (727), 527 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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 18:54:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 727 transitions. [2024-11-06 18:54:02,728 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 727 transitions. Word has length 109 [2024-11-06 18:54:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:02,728 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 727 transitions. [2024-11-06 18:54:02,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 727 transitions. [2024-11-06 18:54:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-06 18:54:02,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:02,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:02,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:54:02,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:02,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2024-11-06 18:54:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:02,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797660595] [2024-11-06 18:54:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:02,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:03,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797660595] [2024-11-06 18:54:03,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797660595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:03,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:03,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217115228] [2024-11-06 18:54:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:03,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:03,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:03,009 INFO L87 Difference]: Start difference. First operand 528 states and 727 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:03,474 INFO L93 Difference]: Finished difference Result 1411 states and 1930 transitions. [2024-11-06 18:54:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:03,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-06 18:54:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:03,478 INFO L225 Difference]: With dead ends: 1411 [2024-11-06 18:54:03,478 INFO L226 Difference]: Without dead ends: 790 [2024-11-06 18:54:03,479 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 18:54:03,479 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:03,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-06 18:54:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2024-11-06 18:54:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.2355623100303952) internal successors, (813), 658 states have internal predecessors, (813), 0 states have call successors, (0), 0 states 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 18:54:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 813 transitions. [2024-11-06 18:54:03,495 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 813 transitions. Word has length 110 [2024-11-06 18:54:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 813 transitions. [2024-11-06 18:54:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 813 transitions. [2024-11-06 18:54:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 18:54:03,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:03,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:03,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:54:03,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1996054594, now seen corresponding path program 1 times [2024-11-06 18:54:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037359742] [2024-11-06 18:54:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037359742] [2024-11-06 18:54:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037359742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:03,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107802844] [2024-11-06 18:54:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:03,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:03,641 INFO L87 Difference]: Start difference. First operand 659 states and 813 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:04,166 INFO L93 Difference]: Finished difference Result 1971 states and 2478 transitions. [2024-11-06 18:54:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-11-06 18:54:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:04,174 INFO L225 Difference]: With dead ends: 1971 [2024-11-06 18:54:04,175 INFO L226 Difference]: Without dead ends: 1314 [2024-11-06 18:54:04,176 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 18:54:04,180 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 374 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:04,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 51 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2024-11-06 18:54:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 921. [2024-11-06 18:54:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2206521739130434) internal successors, (1123), 920 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states 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 18:54:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1123 transitions. [2024-11-06 18:54:04,219 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1123 transitions. Word has length 120 [2024-11-06 18:54:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:04,223 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1123 transitions. [2024-11-06 18:54:04,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1123 transitions. [2024-11-06 18:54:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-06 18:54:04,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:04,227 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:04,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:54:04,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1372788512, now seen corresponding path program 1 times [2024-11-06 18:54:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057392984] [2024-11-06 18:54:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:54:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057392984] [2024-11-06 18:54:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057392984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681641630] [2024-11-06 18:54:04,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:04,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:04,413 INFO L87 Difference]: Start difference. First operand 921 states and 1123 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:04,741 INFO L93 Difference]: Finished difference Result 2364 states and 2855 transitions. [2024-11-06 18:54:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-06 18:54:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:04,752 INFO L225 Difference]: With dead ends: 2364 [2024-11-06 18:54:04,752 INFO L226 Difference]: Without dead ends: 1445 [2024-11-06 18:54:04,753 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 18:54:04,754 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:04,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 41 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-06 18:54:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2024-11-06 18:54:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2131979695431472) internal successors, (1434), 1182 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states 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 18:54:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1434 transitions. [2024-11-06 18:54:04,796 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1434 transitions. Word has length 129 [2024-11-06 18:54:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:04,796 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1434 transitions. [2024-11-06 18:54:04,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1434 transitions. [2024-11-06 18:54:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-06 18:54:04,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:04,798 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:04,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:54:04,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:04,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1521668399, now seen corresponding path program 1 times [2024-11-06 18:54:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:04,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542389414] [2024-11-06 18:54:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:54:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542389414] [2024-11-06 18:54:05,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542389414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:05,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:05,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272431924] [2024-11-06 18:54:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:05,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:05,056 INFO L87 Difference]: Start difference. First operand 1183 states and 1434 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:05,512 INFO L93 Difference]: Finished difference Result 2888 states and 3466 transitions. [2024-11-06 18:54:05,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:05,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-11-06 18:54:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:05,516 INFO L225 Difference]: With dead ends: 2888 [2024-11-06 18:54:05,517 INFO L226 Difference]: Without dead ends: 1707 [2024-11-06 18:54:05,518 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 18:54:05,518 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 370 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:05,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 56 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:54:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-06 18:54:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2024-11-06 18:54:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1869806094182827) internal successors, (1714), 1444 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states 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 18:54:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1714 transitions. [2024-11-06 18:54:05,538 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1714 transitions. Word has length 135 [2024-11-06 18:54:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1714 transitions. [2024-11-06 18:54:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1714 transitions. [2024-11-06 18:54:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-06 18:54:05,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:05,541 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:05,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:54:05,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:05,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1196450926, now seen corresponding path program 1 times [2024-11-06 18:54:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084649] [2024-11-06 18:54:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:05,653 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:54:05,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084649] [2024-11-06 18:54:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:05,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:05,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437448329] [2024-11-06 18:54:05,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:05,655 INFO L87 Difference]: Start difference. First operand 1445 states and 1714 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:06,178 INFO L93 Difference]: Finished difference Result 3150 states and 3752 transitions. [2024-11-06 18:54:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-06 18:54:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:06,184 INFO L225 Difference]: With dead ends: 3150 [2024-11-06 18:54:06,184 INFO L226 Difference]: Without dead ends: 1707 [2024-11-06 18:54:06,186 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 18:54:06,187 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:06,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 60 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:54:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-06 18:54:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2024-11-06 18:54:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1670574443141852) internal successors, (1991), 1706 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states 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 18:54:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1991 transitions. [2024-11-06 18:54:06,220 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1991 transitions. Word has length 153 [2024-11-06 18:54:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:06,221 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1991 transitions. [2024-11-06 18:54:06,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1991 transitions. [2024-11-06 18:54:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-06 18:54:06,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:06,225 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, 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] [2024-11-06 18:54:06,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:54:06,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2104876358, now seen corresponding path program 1 times [2024-11-06 18:54:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557319029] [2024-11-06 18:54:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 18:54:06,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:06,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557319029] [2024-11-06 18:54:06,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557319029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:06,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:06,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:06,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851009590] [2024-11-06 18:54:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:06,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:06,318 INFO L87 Difference]: Start difference. First operand 1707 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 18:54:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:06,674 INFO L93 Difference]: Finished difference Result 3674 states and 4328 transitions. [2024-11-06 18:54:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 169 [2024-11-06 18:54:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:06,680 INFO L225 Difference]: With dead ends: 3674 [2024-11-06 18:54:06,680 INFO L226 Difference]: Without dead ends: 1969 [2024-11-06 18:54:06,682 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 18:54:06,683 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:06,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:06,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-06 18:54:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2024-11-06 18:54:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.160569105691057) internal successors, (2284), 1968 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states 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 18:54:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2284 transitions. [2024-11-06 18:54:06,710 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2284 transitions. Word has length 169 [2024-11-06 18:54:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:06,711 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2284 transitions. [2024-11-06 18:54:06,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 18:54:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2284 transitions. [2024-11-06 18:54:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-06 18:54:06,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:06,714 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:06,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:54:06,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:06,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -548918944, now seen corresponding path program 1 times [2024-11-06 18:54:06,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:06,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899963589] [2024-11-06 18:54:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 18:54:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899963589] [2024-11-06 18:54:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899963589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:54:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508176210] [2024-11-06 18:54:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:54:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:54:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:54:06,886 INFO L87 Difference]: Start difference. First operand 1969 states and 2284 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 18:54:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:07,832 INFO L93 Difference]: Finished difference Result 4329 states and 5000 transitions. [2024-11-06 18:54:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:54:07,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 185 [2024-11-06 18:54:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:07,839 INFO L225 Difference]: With dead ends: 4329 [2024-11-06 18:54:07,839 INFO L226 Difference]: Without dead ends: 2362 [2024-11-06 18:54:07,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:54:07,842 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 224 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:07,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 31 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 18:54:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2024-11-06 18:54:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1969. [2024-11-06 18:54:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1148373983739837) internal successors, (2194), 1968 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states 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 18:54:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2194 transitions. [2024-11-06 18:54:07,873 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2194 transitions. Word has length 185 [2024-11-06 18:54:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:07,874 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2194 transitions. [2024-11-06 18:54:07,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states 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 18:54:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2194 transitions. [2024-11-06 18:54:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-06 18:54:07,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:07,877 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2024-11-06 18:54:07,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:54:07,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:07,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -729698847, now seen corresponding path program 1 times [2024-11-06 18:54:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695268168] [2024-11-06 18:54:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-06 18:54:08,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:08,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695268168] [2024-11-06 18:54:08,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695268168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:54:08,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491214925] [2024-11-06 18:54:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:08,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:54:08,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:54:08,078 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 18:54:08,079 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 18:54:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:08,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:54:08,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:54:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 18:54:08,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:54:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491214925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:54:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 18:54:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24582216] [2024-11-06 18:54:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:08,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:54:08,496 INFO L87 Difference]: Start difference. First operand 1969 states and 2194 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:08,859 INFO L93 Difference]: Finished difference Result 4329 states and 4857 transitions. [2024-11-06 18:54:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-11-06 18:54:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:08,867 INFO L225 Difference]: With dead ends: 4329 [2024-11-06 18:54:08,867 INFO L226 Difference]: Without dead ends: 2362 [2024-11-06 18:54:08,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 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 18:54:08,872 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:08,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2024-11-06 18:54:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2024-11-06 18:54:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1134529147982062) internal successors, (2483), 2230 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states 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 18:54:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2483 transitions. [2024-11-06 18:54:08,913 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2483 transitions. Word has length 254 [2024-11-06 18:54:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2483 transitions. [2024-11-06 18:54:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:54:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2483 transitions. [2024-11-06 18:54:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-06 18:54:08,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:54:08,920 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:54:08,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 18:54:09,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 18:54:09,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:54:09,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:54:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash 961831631, now seen corresponding path program 1 times [2024-11-06 18:54:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:54:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810691995] [2024-11-06 18:54:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:54:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:54:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:54:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-06 18:54:09,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:54:09,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810691995] [2024-11-06 18:54:09,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810691995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:54:09,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:54:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:54:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716235047] [2024-11-06 18:54:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:54:09,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:54:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:54:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:54:09,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:54:09,269 INFO L87 Difference]: Start difference. First operand 2231 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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 18:54:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:54:09,573 INFO L93 Difference]: Finished difference Result 4589 states and 5075 transitions. [2024-11-06 18:54:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:54:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 273 [2024-11-06 18:54:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:54:09,574 INFO L225 Difference]: With dead ends: 4589 [2024-11-06 18:54:09,574 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:54:09,577 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 18:54:09,578 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:54:09,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 28 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:54:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:54:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:54:09,579 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 18:54:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:54:09,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2024-11-06 18:54:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:54:09,580 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:54:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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 18:54:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:54:09,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:54:09,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:54:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:54:09,585 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:54:09,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:54:09,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:54:09,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:54:09 BoogieIcfgContainer [2024-11-06 18:54:09,898 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:54:09,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:54:09,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:54:09,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:54:09,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:54:00" (3/4) ... [2024-11-06 18:54:09,900 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:54:09,916 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:54:09,917 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:54:09,917 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:54:09,918 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:54:10,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:54:10,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:54:10,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:54:10,008 INFO L158 Benchmark]: Toolchain (without parser) took 10688.08ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 83.0MB in the beginning and 132.0MB in the end (delta: -48.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,008 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 83.9MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:54:10,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.43ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 56.3MB in the end (delta: 26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.14ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 50.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,009 INFO L158 Benchmark]: Boogie Preprocessor took 131.94ms. Allocated memory is still 109.1MB. Free memory was 50.7MB in the beginning and 46.0MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,009 INFO L158 Benchmark]: RCFGBuilder took 884.23ms. Allocated memory is still 109.1MB. Free memory was 46.0MB in the beginning and 47.0MB in the end (delta: -1.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,009 INFO L158 Benchmark]: TraceAbstraction took 8945.11ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 46.5MB in the beginning and 143.5MB in the end (delta: -97.0MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,009 INFO L158 Benchmark]: Witness Printer took 109.56ms. Allocated memory is still 293.6MB. Free memory was 143.5MB in the beginning and 132.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:54:10,012 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.67ms. Allocated memory is still 83.9MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.43ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 56.3MB in the end (delta: 26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.14ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 50.7MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.94ms. Allocated memory is still 109.1MB. Free memory was 50.7MB in the beginning and 46.0MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 884.23ms. Allocated memory is still 109.1MB. Free memory was 46.0MB in the beginning and 47.0MB in the end (delta: -1.0MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8945.11ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 46.5MB in the beginning and 143.5MB in the end (delta: -97.0MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Witness Printer took 109.56ms. Allocated memory is still 293.6MB. Free memory was 143.5MB in the beginning and 132.0MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. 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: 495]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1888 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1888 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4669 IncrementalHoareTripleChecker+Invalid, 5390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 563 mSDtfsCounter, 4669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1994 NumberOfCodeBlocks, 1994 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1982 ConstructedInterpolants, 0 QuantifiedInterpolants, 5988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1322/1414 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: 593]: Loop Invariant Derived loop invariant: (((((((((a21 <= 0) && (a20 == 1)) || ((((4 < a16) || (a17 == 1)) && (14 <= a8)) && (a20 == 1))) || ((a7 != 1) && (a16 <= 5))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5))) || (((a20 != 1) && (14 <= a8)) && (a16 <= 5))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((a7 != 1) && (14 <= a8))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:54:10,035 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