./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i', '-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', 'eb317fac4733296e764d15c5d1055d4412d25f784c848e329f8f4334cc494698'] 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i -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 eb317fac4733296e764d15c5d1055d4412d25f784c848e329f8f4334cc494698 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:52:23,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:52:23,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:52:23,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:52:23,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:52:23,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:52:23,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:52:23,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:52:23,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:52:23,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:52:23,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:52:23,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:52:23,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:52:23,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:52:23,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:52:23,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:52:23,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:52:23,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:52:23,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:52:23,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:52:23,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:52:23,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:52:23,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:52:23,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:52:23,672 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 -> eb317fac4733296e764d15c5d1055d4412d25f784c848e329f8f4334cc494698 [2024-11-07 05:52:23,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:52:23,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:52:23,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:52:23,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:52:23,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:52:23,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i [2024-11-07 05:52:25,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:52:25,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:52:25,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i [2024-11-07 05:52:25,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2c63a801/623b7d2a30d24b178ef1354af5a68762/FLAG99f9cbf7e [2024-11-07 05:52:25,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2c63a801/623b7d2a30d24b178ef1354af5a68762 [2024-11-07 05:52:25,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:52:25,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:52:25,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:52:25,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:52:25,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:52:25,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3585ef65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25, skipping insertion in model container [2024-11-07 05:52:25,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:52:25,719 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i[919,932] [2024-11-07 05:52:25,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:52:25,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:52:25,813 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i[919,932] [2024-11-07 05:52:25,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:52:25,872 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:52:25,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25 WrapperNode [2024-11-07 05:52:25,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:52:25,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:52:25,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:52:25,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:52:25,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,939 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-07 05:52:25,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:52:25,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:52:25,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:52:25,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:52:25,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:52:25,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:52:25,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:52:25,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:52:25,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:52:25,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (1/1) ... [2024-11-07 05:52:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:52:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:26,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:52:26,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:52:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:52:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:52:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:52:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:52:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:52:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:52:26,163 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:52:26,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:52:26,518 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 05:52:26,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:52:26,558 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:52:26,558 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:52:26,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:52:26 BoogieIcfgContainer [2024-11-07 05:52:26,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:52:26,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:52:26,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:52:26,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:52:26,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:52:25" (1/3) ... [2024-11-07 05:52:26,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25829027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:52:26, skipping insertion in model container [2024-11-07 05:52:26,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:52:25" (2/3) ... [2024-11-07 05:52:26,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25829027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:52:26, skipping insertion in model container [2024-11-07 05:52:26,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:52:26" (3/3) ... [2024-11-07 05:52:26,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i [2024-11-07 05:52:26,580 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:52:26,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:52:26,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:52:26,645 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;@1fd8987a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:52:26,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:52:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 05:52:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 05:52:26,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:26,668 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:26,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1841187895, now seen corresponding path program 1 times [2024-11-07 05:52:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:26,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226241226] [2024-11-07 05:52:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:26,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:52:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:52:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:52:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:52:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:52:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:52:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:52:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:52:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:52:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:52:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:52:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:52:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:52:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:52:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:52:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:52:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:52:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:52:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:52:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:52:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:52:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:52:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:52:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:52:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:52:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:52:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:52:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:52:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226241226] [2024-11-07 05:52:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226241226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:52:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467097830] [2024-11-07 05:52:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:27,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:52:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:52:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:52:27,186 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:52:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:27,221 INFO L93 Difference]: Finished difference Result 215 states and 386 transitions. [2024-11-07 05:52:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:52:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2024-11-07 05:52:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:27,231 INFO L225 Difference]: With dead ends: 215 [2024-11-07 05:52:27,231 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 05:52:27,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:52:27,237 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:27,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:52:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 05:52:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-07 05:52:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 05:52:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 171 transitions. [2024-11-07 05:52:27,294 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 171 transitions. Word has length 227 [2024-11-07 05:52:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:27,294 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 171 transitions. [2024-11-07 05:52:27,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 05:52:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 171 transitions. [2024-11-07 05:52:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 05:52:27,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:27,301 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:27,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:52:27,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:27,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1840232145, now seen corresponding path program 1 times [2024-11-07 05:52:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969940239] [2024-11-07 05:52:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:52:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:52:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:52:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:52:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:52:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:52:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:52:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:52:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:52:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:52:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:52:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:52:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:52:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:52:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:52:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:52:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:52:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:52:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:52:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:52:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:52:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:52:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:52:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:52:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:52:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:52:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:52:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:52:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969940239] [2024-11-07 05:52:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969940239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380330447] [2024-11-07 05:52:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:27,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:27,642 INFO L87 Difference]: Start difference. First operand 107 states and 171 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:27,699 INFO L93 Difference]: Finished difference Result 263 states and 418 transitions. [2024-11-07 05:52:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2024-11-07 05:52:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:27,702 INFO L225 Difference]: With dead ends: 263 [2024-11-07 05:52:27,702 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 05:52:27,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:27,703 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 74 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:27,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 330 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:52:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 05:52:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-11-07 05:52:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 05:52:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 246 transitions. [2024-11-07 05:52:27,749 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 246 transitions. Word has length 227 [2024-11-07 05:52:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:27,751 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 246 transitions. [2024-11-07 05:52:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 246 transitions. [2024-11-07 05:52:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 05:52:27,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:27,755 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:27,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:52:27,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:27,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:27,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1160173775, now seen corresponding path program 1 times [2024-11-07 05:52:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730695924] [2024-11-07 05:52:27,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:27,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:52:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:52:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:52:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:52:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:52:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:52:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:52:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:52:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:52:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:52:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:52:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:52:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:52:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:52:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:52:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:52:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:52:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:52:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:52:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:52:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:52:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:52:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:52:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:52:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:52:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:52:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:52:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:52:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:28,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730695924] [2024-11-07 05:52:28,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730695924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:28,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:28,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:52:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683983405] [2024-11-07 05:52:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:28,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:52:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:28,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:52:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:28,077 INFO L87 Difference]: Start difference. First operand 156 states and 246 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:28,151 INFO L93 Difference]: Finished difference Result 399 states and 627 transitions. [2024-11-07 05:52:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:52:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2024-11-07 05:52:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:28,156 INFO L225 Difference]: With dead ends: 399 [2024-11-07 05:52:28,156 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 05:52:28,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:52:28,162 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 65 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:28,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 332 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:52:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 05:52:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2024-11-07 05:52:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 177 states have (on average 1.463276836158192) internal successors, (259), 180 states have internal predecessors, (259), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 05:52:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2024-11-07 05:52:28,215 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 227 [2024-11-07 05:52:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:28,216 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2024-11-07 05:52:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2024-11-07 05:52:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 05:52:28,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:28,219 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:28,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:52:28,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:28,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash -737471949, now seen corresponding path program 1 times [2024-11-07 05:52:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738311166] [2024-11-07 05:52:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:52:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:52:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:52:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:52:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:52:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:52:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:52:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:52:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:52:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:52:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:52:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:52:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:52:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:52:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:52:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:52:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:52:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:52:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:52:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:52:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:52:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:52:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:52:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:52:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:52:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:52:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:52:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:52:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:29,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738311166] [2024-11-07 05:52:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738311166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:52:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98077380] [2024-11-07 05:52:29,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:29,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:52:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:52:29,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:52:29,086 INFO L87 Difference]: Start difference. First operand 242 states and 379 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:29,467 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2024-11-07 05:52:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:52:29,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2024-11-07 05:52:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:29,471 INFO L225 Difference]: With dead ends: 684 [2024-11-07 05:52:29,471 INFO L226 Difference]: Without dead ends: 445 [2024-11-07 05:52:29,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:52:29,475 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 104 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:29,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 474 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:52:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-07 05:52:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 415. [2024-11-07 05:52:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 311 states have (on average 1.4855305466237942) internal successors, (462), 314 states have internal predecessors, (462), 96 states have call successors, (96), 7 states have call predecessors, (96), 7 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 05:52:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 654 transitions. [2024-11-07 05:52:29,530 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 654 transitions. Word has length 227 [2024-11-07 05:52:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 654 transitions. [2024-11-07 05:52:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 654 transitions. [2024-11-07 05:52:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-07 05:52:29,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:29,536 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:29,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:52:29,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2125200313, now seen corresponding path program 1 times [2024-11-07 05:52:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500510478] [2024-11-07 05:52:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:52:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:52:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:52:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:52:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:52:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:52:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:52:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:52:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:52:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:52:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:52:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:52:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:52:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:52:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:52:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:52:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:52:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:52:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:52:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:52:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:52:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:52:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:52:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:52:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:52:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:52:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:52:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:52:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:52:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:52:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:52:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:52:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:52:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:52:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:52:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:52:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:29,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500510478] [2024-11-07 05:52:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500510478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:52:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458012253] [2024-11-07 05:52:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:29,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:52:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:52:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:52:29,842 INFO L87 Difference]: Start difference. First operand 415 states and 654 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:30,106 INFO L93 Difference]: Finished difference Result 1177 states and 1857 transitions. [2024-11-07 05:52:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:52:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 229 [2024-11-07 05:52:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:30,113 INFO L225 Difference]: With dead ends: 1177 [2024-11-07 05:52:30,113 INFO L226 Difference]: Without dead ends: 836 [2024-11-07 05:52:30,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:52:30,114 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 167 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:30,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 521 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:52:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-07 05:52:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 808. [2024-11-07 05:52:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 640 states have (on average 1.4984375) internal successors, (959), 646 states have internal predecessors, (959), 156 states have call successors, (156), 11 states have call predecessors, (156), 11 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-07 05:52:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1271 transitions. [2024-11-07 05:52:30,185 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1271 transitions. Word has length 229 [2024-11-07 05:52:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:30,186 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1271 transitions. [2024-11-07 05:52:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1271 transitions. [2024-11-07 05:52:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 05:52:30,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:30,188 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:52:30,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:30,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1235473261, now seen corresponding path program 1 times [2024-11-07 05:52:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873870626] [2024-11-07 05:52:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:52:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928404970] [2024-11-07 05:52:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:30,335 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-07 05:52:30,336 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-07 05:52:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:30,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:52:30,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:52:35,140 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 1 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 1 (mod (div 8 ~var_1_4~0) 4294967296)) (<= 0 ~var_1_4~0))) (< 0 (mod (div 8 c_~var_1_3~0) 4294967296))) is different from true [2024-11-07 05:52:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:52:36,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:52:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:52:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873870626] [2024-11-07 05:52:36,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:52:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928404970] [2024-11-07 05:52:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928404970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:52:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:52:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:52:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586875350] [2024-11-07 05:52:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:52:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:52:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:52:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:52:36,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-07 05:52:36,787 INFO L87 Difference]: Start difference. First operand 808 states and 1271 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:46,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:52:50,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:52:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:52:50,878 INFO L93 Difference]: Finished difference Result 1913 states and 3011 transitions. [2024-11-07 05:52:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:52:50,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-11-07 05:52:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:52:50,886 INFO L225 Difference]: With dead ends: 1913 [2024-11-07 05:52:50,886 INFO L226 Difference]: Without dead ends: 1669 [2024-11-07 05:52:50,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=25, Invalid=33, Unknown=2, NotChecked=12, Total=72 [2024-11-07 05:52:50,888 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 220 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:52:50,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 705 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 54 Invalid, 2 Unknown, 409 Unchecked, 9.1s Time] [2024-11-07 05:52:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-07 05:52:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1498. [2024-11-07 05:52:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1202 states have (on average 1.5074875207986689) internal successors, (1812), 1214 states have internal predecessors, (1812), 276 states have call successors, (276), 19 states have call predecessors, (276), 19 states have return successors, (276), 264 states have call predecessors, (276), 276 states have call successors, (276) [2024-11-07 05:52:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2364 transitions. [2024-11-07 05:52:51,032 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2364 transitions. Word has length 231 [2024-11-07 05:52:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:52:51,035 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2364 transitions. [2024-11-07 05:52:51,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:52:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2364 transitions. [2024-11-07 05:52:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 05:52:51,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:52:51,039 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:52:51,064 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-07 05:52:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:51,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:52:51,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:52:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -977307823, now seen corresponding path program 1 times [2024-11-07 05:52:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:52:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222897797] [2024-11-07 05:52:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:52:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:52:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662103571] [2024-11-07 05:52:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:52:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:52:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:52:51,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:52:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 05:52:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:52:51,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 05:52:51,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:53:00,233 WARN L873 $PredicateComparison]: unable to prove that (or (< 4294967264 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0)))) is different from true [2024-11-07 05:53:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:53:03,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:53:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:53:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222897797] [2024-11-07 05:53:03,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:53:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662103571] [2024-11-07 05:53:03,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662103571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:53:03,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:53:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:53:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724417257] [2024-11-07 05:53:03,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:53:03,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:53:03,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:53:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:53:03,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-07 05:53:03,238 INFO L87 Difference]: Start difference. First operand 1498 states and 2364 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:53:20,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:53:25,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:53:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:53:25,742 INFO L93 Difference]: Finished difference Result 2082 states and 3247 transitions. [2024-11-07 05:53:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:53:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-11-07 05:53:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:53:25,758 INFO L225 Difference]: With dead ends: 2082 [2024-11-07 05:53:25,758 INFO L226 Difference]: Without dead ends: 1587 [2024-11-07 05:53:25,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=4, NotChecked=18, Total=132 [2024-11-07 05:53:25,763 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 101 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:53:25,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 915 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 192 Invalid, 2 Unknown, 348 Unchecked, 9.1s Time] [2024-11-07 05:53:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-11-07 05:53:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1498. [2024-11-07 05:53:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1202 states have (on average 1.5074875207986689) internal successors, (1812), 1214 states have internal predecessors, (1812), 276 states have call successors, (276), 19 states have call predecessors, (276), 19 states have return successors, (276), 264 states have call predecessors, (276), 276 states have call successors, (276) [2024-11-07 05:53:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2364 transitions. [2024-11-07 05:53:25,880 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2364 transitions. Word has length 231 [2024-11-07 05:53:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:53:25,880 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2364 transitions. [2024-11-07 05:53:25,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:53:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2364 transitions. [2024-11-07 05:53:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 05:53:25,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:53:25,885 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:53:25,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 05:53:26,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:53:26,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:53:26,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:53:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2048376785, now seen corresponding path program 1 times [2024-11-07 05:53:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:53:26,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495111426] [2024-11-07 05:53:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:53:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:53:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:53:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 05:53:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:53:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 05:53:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 05:53:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:53:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 05:53:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:53:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 05:53:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 05:53:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 05:53:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 05:53:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 05:53:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 05:53:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:53:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:53:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:53:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:53:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 05:53:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 05:53:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 05:53:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 05:53:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 05:53:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 05:53:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 05:53:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 05:53:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 05:53:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 05:53:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 05:53:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-07 05:53:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 05:53:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-07 05:53:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 05:53:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-07 05:53:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 05:53:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-11-07 05:53:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:53:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495111426] [2024-11-07 05:53:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495111426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:53:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446304907] [2024-11-07 05:53:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:26,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:53:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:53:26,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:53:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:53:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:26,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:53:26,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:53:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1275 proven. 45 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 05:53:27,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:53:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-11-07 05:53:28,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446304907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:53:28,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:53:28,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 05:53:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657953475] [2024-11-07 05:53:28,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:53:28,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:53:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:53:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:53:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:53:28,002 INFO L87 Difference]: Start difference. First operand 1498 states and 2364 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-07 05:53:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:53:28,931 INFO L93 Difference]: Finished difference Result 2834 states and 4436 transitions. [2024-11-07 05:53:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:53:28,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 231 [2024-11-07 05:53:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:53:28,943 INFO L225 Difference]: With dead ends: 2834 [2024-11-07 05:53:28,943 INFO L226 Difference]: Without dead ends: 1540 [2024-11-07 05:53:28,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 530 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:53:28,947 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 159 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 05:53:28,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 381 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 05:53:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-07 05:53:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1518. [2024-11-07 05:53:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1217 states have (on average 1.4691865242399342) internal successors, (1788), 1229 states have internal predecessors, (1788), 276 states have call successors, (276), 24 states have call predecessors, (276), 24 states have return successors, (276), 264 states have call predecessors, (276), 276 states have call successors, (276) [2024-11-07 05:53:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2340 transitions. [2024-11-07 05:53:29,047 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2340 transitions. Word has length 231 [2024-11-07 05:53:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:53:29,048 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2340 transitions. [2024-11-07 05:53:29,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-07 05:53:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2340 transitions. [2024-11-07 05:53:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 05:53:29,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:53:29,052 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:53:29,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:53:29,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:53:29,253 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:53:29,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:53:29,253 INFO L85 PathProgramCache]: Analyzing trace with hash -214404907, now seen corresponding path program 1 times [2024-11-07 05:53:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:53:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947525751] [2024-11-07 05:53:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:53:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:53:29,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688162958] [2024-11-07 05:53:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:29,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:53:29,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:53:29,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:53:29,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 05:53:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:29,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 05:53:29,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:53:30,668 WARN L873 $PredicateComparison]: unable to prove that (or (< 1 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 2 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 2 (mod (div 8 ~var_1_4~0) 4294967296))))) is different from true [2024-11-07 05:53:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:53:33,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:53:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:53:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947525751] [2024-11-07 05:53:33,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:53:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688162958] [2024-11-07 05:53:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688162958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:53:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:53:33,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:53:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108390346] [2024-11-07 05:53:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:53:33,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:53:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:53:33,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:53:33,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-07 05:53:33,103 INFO L87 Difference]: Start difference. First operand 1518 states and 2340 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:53:37,925 WARN L873 $PredicateComparison]: unable to prove that (and (not (= (mod c_~last_1_var_1_1~0 4294967296) 0)) (= c_~var_1_14~0 8) (or (< 1 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 2 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 2 (mod (div 8 ~var_1_4~0) 4294967296))))) (= c_~last_1_var_1_14~0 8)) is different from true [2024-11-07 05:53:42,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:53:46,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:53:51,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 05:53:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:53:51,277 INFO L93 Difference]: Finished difference Result 3571 states and 5524 transitions. [2024-11-07 05:53:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:53:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-11-07 05:53:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:53:51,291 INFO L225 Difference]: With dead ends: 3571 [2024-11-07 05:53:51,292 INFO L226 Difference]: Without dead ends: 3066 [2024-11-07 05:53:51,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=35, Invalid=61, Unknown=2, NotChecked=34, Total=132 [2024-11-07 05:53:51,295 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 330 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 76 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 651 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-07 05:53:51,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1202 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 283 Invalid, 3 Unknown, 651 Unchecked, 13.9s Time] [2024-11-07 05:53:51,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2024-11-07 05:53:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 2311. [2024-11-07 05:53:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 1880 states have (on average 1.4813829787234043) internal successors, (2785), 1898 states have internal predecessors, (2785), 396 states have call successors, (396), 34 states have call predecessors, (396), 34 states have return successors, (396), 378 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-07 05:53:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3577 transitions. [2024-11-07 05:53:51,447 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3577 transitions. Word has length 231 [2024-11-07 05:53:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:53:51,448 INFO L471 AbstractCegarLoop]: Abstraction has 2311 states and 3577 transitions. [2024-11-07 05:53:51,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-07 05:53:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3577 transitions. [2024-11-07 05:53:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 05:53:51,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:53:51,452 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:53:51,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 05:53:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 05:53:51,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:53:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:53:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 43760531, now seen corresponding path program 1 times [2024-11-07 05:53:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:53:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636216861] [2024-11-07 05:53:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:53:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:53:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829909431] [2024-11-07 05:53:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:53:51,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:53:51,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:53:51,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:53:51,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 05:53:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:53:51,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 05:53:51,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:53:59,337 WARN L873 $PredicateComparison]: unable to prove that (or (< 4294967264 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0)))) is different from true [2024-11-07 05:54:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 05:54:02,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:54:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:54:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636216861] [2024-11-07 05:54:02,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:54:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829909431] [2024-11-07 05:54:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829909431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:54:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:54:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:54:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763860969] [2024-11-07 05:54:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:54:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:54:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:54:02,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:54:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-11-07 05:54:02,619 INFO L87 Difference]: Start difference. First operand 2311 states and 3577 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36)