./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166'] 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/nla-digbench-scaling/ps6-ll_valuebound50.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:15:21,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:15:21,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:15:21,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:15:21,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:15:21,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:15:21,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:15:21,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:15:21,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:15:21,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:15:21,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:15:21,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:15:21,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:15:21,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:15:21,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:15:21,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:15:21,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:15:21,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:15:21,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:15:21,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:15:21,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:15:21,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:15:21,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:15:21,347 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 -> aa3033c827040052fc2b3f2ac84da9b892249c5596676af10298d2e88bf55166 [2024-11-06 23:15:21,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:15:21,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:15:21,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:15:21,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:15:21,556 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:15:21,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-11-06 23:15:22,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:15:22,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:15:22,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound50.c [2024-11-06 23:15:22,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90abe06c2/f4deb219f97d4d4baf18db5b96702b90/FLAGdeffb1ec7 [2024-11-06 23:15:23,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90abe06c2/f4deb219f97d4d4baf18db5b96702b90 [2024-11-06 23:15:23,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:15:23,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:15:23,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:15:23,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:15:23,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:15:23,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca0651f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23, skipping insertion in model container [2024-11-06 23:15:23,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:15:23,348 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/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2024-11-06 23:15:23,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:15:23,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:15:23,376 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/nla-digbench-scaling/ps6-ll_valuebound50.c[458,471] [2024-11-06 23:15:23,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:15:23,388 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:15:23,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23 WrapperNode [2024-11-06 23:15:23,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:15:23,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:15:23,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:15:23,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:15:23,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,405 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-11-06 23:15:23,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:15:23,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:15:23,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:15:23,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:15:23,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 23:15:23,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:15:23,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:15:23,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:15:23,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:15:23,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (1/1) ... [2024-11-06 23:15:23,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:15:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:23,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:15:23,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:15:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:15:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 23:15:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 23:15:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:15:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:15:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:15:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 23:15:23,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 23:15:23,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:15:23,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:15:23,597 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-06 23:15:23,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:15:23,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:15:23,603 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 23:15:23,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:15:23 BoogieIcfgContainer [2024-11-06 23:15:23,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:15:23,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:15:23,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:15:23,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:15:23,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:15:23" (1/3) ... [2024-11-06 23:15:23,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36feb947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:15:23, skipping insertion in model container [2024-11-06 23:15:23,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:15:23" (2/3) ... [2024-11-06 23:15:23,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36feb947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:15:23, skipping insertion in model container [2024-11-06 23:15:23,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:15:23" (3/3) ... [2024-11-06 23:15:23,611 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound50.c [2024-11-06 23:15:23,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:15:23,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:15:23,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:15:23,656 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;@650e93d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:15:23,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:15:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 23:15:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 23:15:23,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:23,664 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:23,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:23,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1845349065, now seen corresponding path program 1 times [2024-11-06 23:15:23,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972713886] [2024-11-06 23:15:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:15:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-06 23:15:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 23:15:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:15:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972713886] [2024-11-06 23:15:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972713886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:15:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:15:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 23:15:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817209567] [2024-11-06 23:15:23,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:15:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 23:15:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:15:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 23:15:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 23:15:23,784 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 23:15:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:15:23,795 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2024-11-06 23:15:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 23:15:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-06 23:15:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:15:23,802 INFO L225 Difference]: With dead ends: 45 [2024-11-06 23:15:23,802 INFO L226 Difference]: Without dead ends: 20 [2024-11-06 23:15:23,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-06 23:15:23,805 INFO L432 NwaCegarLoop]: 27 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, 27 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-06 23:15:23,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:15:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-06 23:15:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-06 23:15:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 23:15:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-06 23:15:23,825 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2024-11-06 23:15:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:15:23,825 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-06 23:15:23,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 23:15:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-06 23:15:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 23:15:23,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:23,827 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:23,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:15:23,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:23,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:23,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1506842435, now seen corresponding path program 1 times [2024-11-06 23:15:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:23,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446904591] [2024-11-06 23:15:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:23,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 23:15:23,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281295585] [2024-11-06 23:15:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:23,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:15:23,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 23:15:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:23,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 23:15:23,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:15:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 23:15:23,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:15:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:15:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446904591] [2024-11-06 23:15:23,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 23:15:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281295585] [2024-11-06 23:15:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281295585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:15:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:15:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:15:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142167540] [2024-11-06 23:15:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:15:23,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:15:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:15:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:15:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:15:23,998 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 23:15:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:15:24,045 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-06 23:15:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:15:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-11-06 23:15:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:15:24,046 INFO L225 Difference]: With dead ends: 31 [2024-11-06 23:15:24,046 INFO L226 Difference]: Without dead ends: 27 [2024-11-06 23:15:24,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:15:24,046 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:15:24,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:15:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-06 23:15:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-06 23:15:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 23:15:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-11-06 23:15:24,053 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2024-11-06 23:15:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:15:24,053 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-11-06 23:15:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-06 23:15:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-11-06 23:15:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 23:15:24,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:24,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:24,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 23:15:24,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:24,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:24,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash 903983968, now seen corresponding path program 1 times [2024-11-06 23:15:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836009053] [2024-11-06 23:15:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 23:15:24,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2138440691] [2024-11-06 23:15:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:24,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:15:24,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 23:15:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:24,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 23:15:24,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:15:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 23:15:24,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:15:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 23:15:24,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:15:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836009053] [2024-11-06 23:15:24,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 23:15:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138440691] [2024-11-06 23:15:24,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138440691] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 23:15:24,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:15:24,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-06 23:15:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142149870] [2024-11-06 23:15:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:15:24,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:15:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:15:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:15:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:15:24,481 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:15:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:15:24,518 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-06 23:15:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:15:24,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-06 23:15:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:15:24,519 INFO L225 Difference]: With dead ends: 33 [2024-11-06 23:15:24,519 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 23:15:24,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:15:24,520 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:15:24,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:15:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 23:15:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-06 23:15:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 23:15:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-06 23:15:24,527 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2024-11-06 23:15:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:15:24,527 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-06 23:15:24,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:15:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-06 23:15:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 23:15:24,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:24,528 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:24,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 23:15:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:24,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1648043046, now seen corresponding path program 1 times [2024-11-06 23:15:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142664180] [2024-11-06 23:15:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 23:15:24,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258534724] [2024-11-06 23:15:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:24,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:15:24,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 23:15:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:15:24,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-06 23:15:24,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:15:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 23:15:24,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:15:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 23:15:25,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:15:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142664180] [2024-11-06 23:15:25,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 23:15:25,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258534724] [2024-11-06 23:15:25,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258534724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:15:25,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 23:15:25,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-11-06 23:15:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030599302] [2024-11-06 23:15:25,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 23:15:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 23:15:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:15:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 23:15:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-06 23:15:25,348 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-06 23:15:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:15:25,576 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-06 23:15:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 23:15:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 36 [2024-11-06 23:15:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:15:25,577 INFO L225 Difference]: With dead ends: 50 [2024-11-06 23:15:25,577 INFO L226 Difference]: Without dead ends: 42 [2024-11-06 23:15:25,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-11-06 23:15:25,581 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:15:25,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:15:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-06 23:15:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-06 23:15:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 23:15:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-06 23:15:25,598 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 36 [2024-11-06 23:15:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:15:25,598 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-06 23:15:25,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-06 23:15:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-06 23:15:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 23:15:25,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:25,600 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:25,613 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-06 23:15:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:25,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1013596503, now seen corresponding path program 2 times [2024-11-06 23:15:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435196697] [2024-11-06 23:15:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 23:15:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092136581] [2024-11-06 23:15:25,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 23:15:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:25,829 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-06 23:15:25,830 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-06 23:15:25,886 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 23:15:25,887 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 23:15:25,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-06 23:15:25,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:15:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-06 23:15:26,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:15:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 23:15:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:15:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435196697] [2024-11-06 23:15:27,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-06 23:15:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092136581] [2024-11-06 23:15:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092136581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 23:15:27,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 23:15:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-06 23:15:27,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30279921] [2024-11-06 23:15:27,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 23:15:27,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 23:15:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:15:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 23:15:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-06 23:15:27,055 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-06 23:15:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:15:27,625 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-06 23:15:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 23:15:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 57 [2024-11-06 23:15:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:15:27,627 INFO L225 Difference]: With dead ends: 71 [2024-11-06 23:15:27,628 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 23:15:27,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2024-11-06 23:15:27,630 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:15:27,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:15:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 23:15:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-11-06 23:15:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-06 23:15:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-06 23:15:27,647 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 57 [2024-11-06 23:15:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:15:27,648 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-06 23:15:27,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-06 23:15:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-06 23:15:27,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-06 23:15:27,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:15:27,649 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:15:27,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-06 23:15:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:27,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:15:27,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:15:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1063034534, now seen corresponding path program 3 times [2024-11-06 23:15:27,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:15:27,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761178203] [2024-11-06 23:15:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:15:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:15:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 23:15:27,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007020685] [2024-11-06 23:15:27,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 23:15:27,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:15:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:15:27,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:15:27,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 23:15:28,017 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-06 23:15:28,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 23:15:28,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-06 23:15:28,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:15:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 27 proven. 160 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-06 23:15:28,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 23:15:36,614 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-11-06 23:15:44,640 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 23:15:56,664 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 23:16:12,720 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 23:16:16,731 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 10) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7)) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7) .cse0) (+ (* 7 |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|))))))) is different from true [2024-11-06 23:16:32,779 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 23:16:48,831 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-06 23:16:52,840 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 10) .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7)) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| 7) .cse0) (+ (* 7 |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_45| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_32|)))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-11-06 23:17:04,904 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 8)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 8))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false