./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.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_loopvsstraightlinecode_25-1loop_file-37.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', '602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9'] 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_loopvsstraightlinecode_25-1loop_file-37.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 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:20:01,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:20:01,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:20:01,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:20:01,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:20:01,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:20:01,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:20:01,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:20:01,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:20:01,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:20:01,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:20:01,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:20:01,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:20:01,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:20:01,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:20:01,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:20:01,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:20:01,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:20:01,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:20:01,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:01,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:20:01,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:20:01,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:20:01,578 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 -> 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 [2024-11-07 08:20:01,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:20:01,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:20:01,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:20:01,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:20:01,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:20:01,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:03,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:20:03,528 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:20:03,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:03,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bda8fcf5/cad4de3c069a464e87378c2007f5cedb/FLAGdc6e93f28 [2024-11-07 08:20:03,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9bda8fcf5/cad4de3c069a464e87378c2007f5cedb [2024-11-07 08:20:03,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:20:03,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:20:03,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:03,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:20:03,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:20:03,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:03" (1/1) ... [2024-11-07 08:20:03,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3665b356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:03, skipping insertion in model container [2024-11-07 08:20:03,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:03" (1/1) ... [2024-11-07 08:20:03,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:20:03,989 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2024-11-07 08:20:04,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:04,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:20:04,032 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2024-11-07 08:20:04,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:04,059 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:20:04,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04 WrapperNode [2024-11-07 08:20:04,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:04,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:04,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:20:04,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:20:04,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,100 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-07 08:20:04,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:04,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:20:04,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:20:04,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:20:04,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,120 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 08:20:04,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:20:04,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:20:04,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:20:04,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:20:04,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (1/1) ... [2024-11-07 08:20:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:04,185 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 08:20:04,188 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 08:20:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:20:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:20:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:20:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:20:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:20:04,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:20:04,332 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:20:04,334 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:20:04,648 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 08:20:04,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:20:04,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:20:04,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:20:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:04 BoogieIcfgContainer [2024-11-07 08:20:04,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:20:04,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:20:04,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:20:04,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:20:04,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:20:03" (1/3) ... [2024-11-07 08:20:04,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3508a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:04, skipping insertion in model container [2024-11-07 08:20:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:04" (2/3) ... [2024-11-07 08:20:04,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3508a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:04, skipping insertion in model container [2024-11-07 08:20:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:04" (3/3) ... [2024-11-07 08:20:04,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:04,674 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:20:04,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:20:04,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:20:04,717 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;@1821f9b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:20:04,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:20:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 08:20:04,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:04,726 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:04,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -995346468, now seen corresponding path program 1 times [2024-11-07 08:20:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704269978] [2024-11-07 08:20:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:20:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:20:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:20:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:20:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 08:20:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704269978] [2024-11-07 08:20:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704269978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:04,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:20:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538512460] [2024-11-07 08:20:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:20:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:20:04,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:20:04,928 INFO L87 Difference]: Start difference. First operand has 51 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 08:20:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:04,941 INFO L93 Difference]: Finished difference Result 99 states and 152 transitions. [2024-11-07 08:20:04,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:20:04,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2024-11-07 08:20:04,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:04,947 INFO L225 Difference]: With dead ends: 99 [2024-11-07 08:20:04,947 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 08:20:04,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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 08:20:04,951 INFO L432 NwaCegarLoop]: 70 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, 70 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 08:20:04,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:20:04,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 08:20:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 08:20:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-07 08:20:04,977 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 68 [2024-11-07 08:20:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:04,978 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-07 08:20:04,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 08:20:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-07 08:20:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 08:20:04,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:04,980 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:20:04,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:04,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2016633822, now seen corresponding path program 1 times [2024-11-07 08:20:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66884097] [2024-11-07 08:20:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:20:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:20:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:20:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:20:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 08:20:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:05,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66884097] [2024-11-07 08:20:05,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66884097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:05,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:05,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:20:05,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988621811] [2024-11-07 08:20:05,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:20:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:05,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:20:05,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:20:05,379 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:05,425 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2024-11-07 08:20:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:20:05,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 68 [2024-11-07 08:20:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:05,428 INFO L225 Difference]: With dead ends: 91 [2024-11-07 08:20:05,429 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 08:20:05,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 08:20:05,432 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:05,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:20:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 08:20:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 08:20:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-07 08:20:05,447 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 68 [2024-11-07 08:20:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:05,448 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-07 08:20:05,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-07 08:20:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 08:20:05,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:05,450 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:05,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:20:05,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:05,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1207287196, now seen corresponding path program 1 times [2024-11-07 08:20:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000879528] [2024-11-07 08:20:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:05,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:20:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:20:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:20:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:20:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000879528] [2024-11-07 08:20:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000879528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:20:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278329258] [2024-11-07 08:20:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:05,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:05,795 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 08:20:05,798 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 08:20:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:05,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 08:20:05,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:20:06,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:20:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278329258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:20:06,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:20:06,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 08:20:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7363380] [2024-11-07 08:20:06,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:20:06,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:20:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:20:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:20:06,371 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 08:20:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:06,544 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2024-11-07 08:20:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:20:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 68 [2024-11-07 08:20:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:06,546 INFO L225 Difference]: With dead ends: 97 [2024-11-07 08:20:06,547 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 08:20:06,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:20:06,549 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 106 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:06,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:20:06,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 08:20:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-07 08:20:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-11-07 08:20:06,561 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 68 [2024-11-07 08:20:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:06,561 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-07 08:20:06,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 08:20:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-11-07 08:20:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 08:20:06,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:06,566 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:06,586 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 08:20:06,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:06,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:06,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash 365702944, now seen corresponding path program 1 times [2024-11-07 08:20:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362299017] [2024-11-07 08:20:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:20:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:20:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:20:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:20:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:20:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:20:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:20:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:20:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:20:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362299017] [2024-11-07 08:20:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362299017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:20:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095185587] [2024-11-07 08:20:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:07,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:07,038 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 08:20:07,039 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 08:20:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:20:07,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:20:07,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:20:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095185587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:20:07,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:20:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-11-07 08:20:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642620184] [2024-11-07 08:20:07,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:20:07,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:20:07,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:20:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:20:07,310 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 08:20:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:07,447 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2024-11-07 08:20:07,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:20:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 70 [2024-11-07 08:20:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:07,448 INFO L225 Difference]: With dead ends: 103 [2024-11-07 08:20:07,450 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 08:20:07,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:20:07,451 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 109 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:07,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 135 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:20:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 08:20:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-07 08:20:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-07 08:20:07,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 70 [2024-11-07 08:20:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-07 08:20:07,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-07 08:20:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-07 08:20:07,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 08:20:07,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:07,462 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:07,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 08:20:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:07,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1906051370, now seen corresponding path program 1 times [2024-11-07 08:20:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009279853] [2024-11-07 08:20:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:20:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037533302] [2024-11-07 08:20:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:07,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:07,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:07,736 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 08:20:07,737 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 08:20:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:07,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 08:20:07,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 08:20:08,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:08,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:20:08,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009279853] [2024-11-07 08:20:08,214 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:20:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037533302] [2024-11-07 08:20:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037533302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:20:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122142509] [2024-11-07 08:20:08,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:08,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:20:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:20:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:20:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:20:08,217 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:08,371 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2024-11-07 08:20:08,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:20:08,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-11-07 08:20:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:08,373 INFO L225 Difference]: With dead ends: 150 [2024-11-07 08:20:08,373 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 08:20:08,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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 08:20:08,373 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 47 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:08,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 150 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:20:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 08:20:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2024-11-07 08:20:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 69 states have internal predecessors, (82), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 08:20:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2024-11-07 08:20:08,405 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 71 [2024-11-07 08:20:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:08,405 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2024-11-07 08:20:08,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2024-11-07 08:20:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 08:20:08,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:08,408 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:08,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 08:20:08,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:08,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1383565056, now seen corresponding path program 1 times [2024-11-07 08:20:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:20:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333909051] [2024-11-07 08:20:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:20:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:20:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [474761893] [2024-11-07 08:20:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:08,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:20:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:08,744 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 08:20:08,749 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 08:20:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:20:08,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:20:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:20:08,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:20:08,856 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:20:08,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:20:08,873 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 08:20:09,058 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,SelfDestructingSolverStorable5 [2024-11-07 08:20:09,061 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 08:20:09,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:20:09,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:20:09 BoogieIcfgContainer [2024-11-07 08:20:09,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:20:09,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:20:09,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:20:09,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:20:09,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:04" (3/4) ... [2024-11-07 08:20:09,109 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:20:09,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:20:09,111 INFO L158 Benchmark]: Toolchain (without parser) took 5224.66ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 77.1MB in the beginning and 77.2MB in the end (delta: -113.2kB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-07 08:20:09,111 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:09,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.55ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 64.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:20:09,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:20:09,112 INFO L158 Benchmark]: Boogie Preprocessor took 44.19ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:09,112 INFO L158 Benchmark]: RCFGBuilder took 512.36ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 74.4MB in the end (delta: -17.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-07 08:20:09,112 INFO L158 Benchmark]: TraceAbstraction took 4445.62ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.0MB in the beginning and 78.5MB in the end (delta: -4.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-07 08:20:09,113 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 125.8MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:20:09,116 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.55ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 64.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 61.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.19ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 512.36ms. Allocated memory is still 100.7MB. Free memory was 57.0MB in the beginning and 74.4MB in the end (delta: -17.5MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4445.62ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.0MB in the beginning and 78.5MB in the end (delta: -4.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 125.8MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of bitwiseOr at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned char var_1_6 = 4; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 64; [L27] unsigned long int var_1_9 = 64; [L28] unsigned long int var_1_10 = 1776833134; [L29] signed long int var_1_11 = -16; [L30] double var_1_12 = 0.25; [L31] double var_1_13 = 5.5; [L32] unsigned char last_1_var_1_8 = 64; [L33] signed long int last_1_var_1_11 = -16; VAL [isInitial=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=59049, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L64] var_1_6 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_8=64, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L70] var_1_10 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_10 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L71] RET assume_abort_if_not(var_1_10 >= 1073741824) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L90] RET updateVariables() [L91] CALL step() [L37] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L37] COND TRUE ((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64 [L38] var_1_1 = ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=-16, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L44] var_1_11 = var_1_1 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=64, var_1_9=64] [L45] COND TRUE var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2))) [L46] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L52] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, stepLocal_0=1, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=64] [L53] COND FALSE !(var_1_1 > stepLocal_0) [L56] var_1_9 = ((1228227409u + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L58] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L91] RET step() [L92] CALL, EXPR property() [L81] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L81-L82] return (((((((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64) ? (var_1_1 == ((unsigned char) ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))))) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) && ((var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2)))) ? (var_1_8 == ((unsigned char) var_1_6)) : (var_1_7 ? (var_1_8 == ((unsigned char) var_1_6)) : 1))) && ((var_1_1 > var_1_1) ? (var_1_9 == ((unsigned long int) var_1_2)) : (var_1_9 == ((unsigned long int) ((1228227409u + var_1_10) - var_1_11))))) && (var_1_11 == ((signed long int) var_1_1))) && (var_1_12 == ((double) var_1_13)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1073741824, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2301969232] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 269 mSDtfsCounter, 256 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 1770 SizeOfPredicates, 8 NumberOfNonLiveVariables, 545 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1152/1296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 08:20:09,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_loopvsstraightlinecode_25-1loop_file-37.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:20:11,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:20:11,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:20:11,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:20:11,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:20:11,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:20:11,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:20:11,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:20:11,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:20:11,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:20:11,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:20:11,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:20:11,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:20:11,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:20:11,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:20:11,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:20:11,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:11,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:20:11,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:20:11,591 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 -> 602710bfdeba1413bfd2cc1b6bd5a194591bac373d29bd83e435c67ebf5ec2d9 [2024-11-07 08:20:11,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:20:11,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:20:11,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:20:11,860 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:20:11,860 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:20:11,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:13,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:20:13,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:20:13,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:13,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67d84f22/6d8d9f49117949e7b1cc7d0ac249eed5/FLAGe659720aa [2024-11-07 08:20:13,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b67d84f22/6d8d9f49117949e7b1cc7d0ac249eed5 [2024-11-07 08:20:13,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:20:13,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:20:13,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:13,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:20:13,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:20:13,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3b6a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13, skipping insertion in model container [2024-11-07 08:20:13,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:20:13,677 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2024-11-07 08:20:13,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:13,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:20:13,744 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_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2024-11-07 08:20:13,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:20:13,786 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:20:13,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13 WrapperNode [2024-11-07 08:20:13,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:20:13,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:13,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:20:13,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:20:13,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,814 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-07 08:20:13,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:20:13,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:20:13,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:20:13,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:20:13,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,845 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 08:20:13,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:20:13,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:20:13,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:20:13,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:20:13,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (1/1) ... [2024-11-07 08:20:13,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:20:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:20:13,904 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 08:20:13,917 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 08:20:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:20:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:20:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:20:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:20:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:20:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:20:14,001 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:20:14,003 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:20:14,217 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 08:20:14,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:20:14,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:20:14,228 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:20:14,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:14 BoogieIcfgContainer [2024-11-07 08:20:14,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:20:14,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:20:14,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:20:14,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:20:14,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:20:13" (1/3) ... [2024-11-07 08:20:14,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b25a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:14, skipping insertion in model container [2024-11-07 08:20:14,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:20:13" (2/3) ... [2024-11-07 08:20:14,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b25a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:20:14, skipping insertion in model container [2024-11-07 08:20:14,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:20:14" (3/3) ... [2024-11-07 08:20:14,238 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i [2024-11-07 08:20:14,250 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:20:14,250 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:20:14,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:20:14,306 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;@5672974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:20:14,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:20:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 08:20:14,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:14,318 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:14,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:14,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 573485790, now seen corresponding path program 1 times [2024-11-07 08:20:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:20:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823349844] [2024-11-07 08:20:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:14,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:14,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:20:14,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:20:14,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 08:20:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:14,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:20:14,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 08:20:14,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:14,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:20:14,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823349844] [2024-11-07 08:20:14,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823349844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:20:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710038067] [2024-11-07 08:20:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:14,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:20:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:20:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:20:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:20:14,553 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 08:20:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:14,579 INFO L93 Difference]: Finished difference Result 81 states and 122 transitions. [2024-11-07 08:20:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:20:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-07 08:20:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:14,588 INFO L225 Difference]: With dead ends: 81 [2024-11-07 08:20:14,588 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 08:20:14,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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 08:20:14,593 INFO L432 NwaCegarLoop]: 55 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, 55 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 08:20:14,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:20:14,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 08:20:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 08:20:14,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-07 08:20:14,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 65 [2024-11-07 08:20:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:14,631 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-07 08:20:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 08:20:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-07 08:20:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 08:20:14,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:14,634 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:14,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 08:20:14,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:14,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:14,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -34810340, now seen corresponding path program 1 times [2024-11-07 08:20:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:20:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459826237] [2024-11-07 08:20:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:14,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:20:14,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:20:14,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 08:20:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:14,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 08:20:14,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 08:20:15,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:15,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:20:15,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459826237] [2024-11-07 08:20:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459826237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:20:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356505221] [2024-11-07 08:20:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:15,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:20:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:20:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:20:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:20:15,051 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:15,144 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2024-11-07 08:20:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:20:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-07 08:20:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:15,153 INFO L225 Difference]: With dead ends: 73 [2024-11-07 08:20:15,153 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 08:20:15,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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 08:20:15,154 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:15,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:20:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 08:20:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-07 08:20:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-07 08:20:15,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 65 [2024-11-07 08:20:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:15,164 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-07 08:20:15,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-07 08:20:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 08:20:15,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:15,165 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:15,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 08:20:15,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:15,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash 22447962, now seen corresponding path program 1 times [2024-11-07 08:20:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:20:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381891753] [2024-11-07 08:20:15,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:15,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:15,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:20:15,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:20:15,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:20:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:15,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 08:20:15,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:37,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:37,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:20:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381891753] [2024-11-07 08:20:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381891753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:37,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:20:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:20:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707129615] [2024-11-07 08:20:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:37,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 08:20:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:20:37,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 08:20:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:20:37,530 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:20:39,494 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2024-11-07 08:20:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:20:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 65 [2024-11-07 08:20:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:20:39,496 INFO L225 Difference]: With dead ends: 90 [2024-11-07 08:20:39,496 INFO L226 Difference]: Without dead ends: 55 [2024-11-07 08:20:39,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:20:39,498 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:20:39,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 197 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 08:20:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-07 08:20:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-07 08:20:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:20:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-11-07 08:20:39,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 65 [2024-11-07 08:20:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:20:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-11-07 08:20:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:20:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-11-07 08:20:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 08:20:39,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:20:39,505 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:20:39,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 08:20:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:39,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:20:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:20:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 308291475, now seen corresponding path program 1 times [2024-11-07 08:20:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:20:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378817175] [2024-11-07 08:20:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:39,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:20:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:20:39,717 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:20:39,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 08:20:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:39,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:20:39,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:20:40,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:20:40,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:20:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378817175] [2024-11-07 08:20:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378817175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:20:40,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1719077339] [2024-11-07 08:20:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:20:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:20:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:20:40,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:20:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 08:20:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:20:40,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 08:20:40,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:20:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:20:59,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:20:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1719077339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:20:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:20:59,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2024-11-07 08:20:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68261334] [2024-11-07 08:20:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:20:59,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 08:20:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:20:59,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 08:20:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:20:59,442 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:21:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:21:08,590 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2024-11-07 08:21:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:21:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-11-07 08:21:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:21:08,600 INFO L225 Difference]: With dead ends: 125 [2024-11-07 08:21:08,600 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 08:21:08,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2024-11-07 08:21:08,601 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 85 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:21:08,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 221 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-07 08:21:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 08:21:08,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2024-11-07 08:21:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 08:21:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-11-07 08:21:08,632 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 66 [2024-11-07 08:21:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:21:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-11-07 08:21:08,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:21:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-11-07 08:21:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 08:21:08,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:21:08,636 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:21:08,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 08:21:08,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 08:21:09,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:21:09,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:21:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:21:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash -84735535, now seen corresponding path program 1 times [2024-11-07 08:21:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:21:09,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58330682] [2024-11-07 08:21:09,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:21:09,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:21:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:21:09,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:21:09,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 08:21:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:21:09,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:21:09,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:21:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:21:09,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:21:09,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:21:09,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58330682] [2024-11-07 08:21:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58330682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:21:09,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1878676250] [2024-11-07 08:21:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:21:09,879 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:21:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:21:09,881 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:21:09,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 08:21:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:21:10,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 08:21:10,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:21:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 08:21:27,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:21:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1878676250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:21:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:21:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2024-11-07 08:21:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081711802] [2024-11-07 08:21:27,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:21:27,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 08:21:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:21:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 08:21:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:21:27,096 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:21:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:21:32,812 INFO L93 Difference]: Finished difference Result 142 states and 177 transitions. [2024-11-07 08:21:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:21:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-11-07 08:21:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:21:32,816 INFO L225 Difference]: With dead ends: 142 [2024-11-07 08:21:32,817 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 08:21:32,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2024-11-07 08:21:32,818 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:21:32,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 237 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 08:21:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 08:21:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-07 08:21:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 08:21:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-11-07 08:21:32,840 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 66 [2024-11-07 08:21:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:21:32,840 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-11-07 08:21:32,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 08:21:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-11-07 08:21:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 08:21:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:21:32,841 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:21:32,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 08:21:33,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 08:21:33,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 08:21:33,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:21:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:21:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1230833452, now seen corresponding path program 1 times [2024-11-07 08:21:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:21:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140361426] [2024-11-07 08:21:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:21:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 08:21:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:21:33,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 08:21:33,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 08:21:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:21:33,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:21:33,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:21:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 08:21:33,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:21:33,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:21:33,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140361426] [2024-11-07 08:21:33,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140361426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:21:33,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1589331185] [2024-11-07 08:21:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:21:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 08:21:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 08:21:33,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 08:21:33,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 08:21:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:21:34,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 08:21:34,457 INFO L278 TraceCheckSpWp]: Computing forward predicates...