./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/fermat1-ll_valuebound10.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c6b05ef27bc57afa4e7776361d8c320f2c4d1efbfc422ad92c7a9c3c2e549e04'] 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/fermat1-ll_valuebound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b05ef27bc57afa4e7776361d8c320f2c4d1efbfc422ad92c7a9c3c2e549e04 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:25:32,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:25:33,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:25:33,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:25:33,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:25:33,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:25:33,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:25:33,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:25:33,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:25:33,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:25:33,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:25:33,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:25:33,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:25:33,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:25:33,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:25:33,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:25:33,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:25:33,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:25:33,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:25:33,075 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 ! overflow) ) 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 -> c6b05ef27bc57afa4e7776361d8c320f2c4d1efbfc422ad92c7a9c3c2e549e04 [2024-11-07 20:25:33,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:25:33,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:25:33,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:25:33,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:25:33,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:25:33,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound10.c [2024-11-07 20:25:34,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:25:34,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:25:34,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound10.c [2024-11-07 20:25:34,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acbaff71c/a3659018d6424bd9832ea5cd3c7bd009/FLAGfb5ca7e8b [2024-11-07 20:25:34,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acbaff71c/a3659018d6424bd9832ea5cd3c7bd009 [2024-11-07 20:25:34,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:25:34,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:25:34,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:25:34,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:25:34,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:25:34,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:34,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109d2e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34, skipping insertion in model container [2024-11-07 20:25:34,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:34,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:25:34,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:25:34,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:25:34,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:25:34,947 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:25:34,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34 WrapperNode [2024-11-07 20:25:34,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:25:34,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:25:34,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:25:34,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:25:34,953 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:25:34" (1/1) ... [2024-11-07 20:25:34,958 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:25:34" (1/1) ... [2024-11-07 20:25:34,982 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-11-07 20:25:34,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:25:34,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:25:34,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:25:34,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:25:34,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:34,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:34,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,008 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 20:25:35,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:25:35,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:25:35,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:25:35,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:25:35,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (1/1) ... [2024-11-07 20:25:35,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:25:35,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:35,039 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 20:25:35,044 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 20:25:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:25:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 20:25:35,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 20:25:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:25:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:25:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:25:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:25:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:25:35,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:25:35,102 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:25:35,433 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-07 20:25:35,434 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:25:35,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:25:35,444 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 20:25:35,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:35 BoogieIcfgContainer [2024-11-07 20:25:35,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:25:35,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:25:35,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:25:35,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:25:35,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:25:34" (1/3) ... [2024-11-07 20:25:35,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5349db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:35, skipping insertion in model container [2024-11-07 20:25:35,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:34" (2/3) ... [2024-11-07 20:25:35,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5349db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:35, skipping insertion in model container [2024-11-07 20:25:35,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:35" (3/3) ... [2024-11-07 20:25:35,452 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound10.c [2024-11-07 20:25:35,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:25:35,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-07 20:25:35,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:25:35,532 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;@74233ade, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:25:35,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-07 20:25:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 204 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 20:25:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:25:35,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:35,542 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:35,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1439424693, now seen corresponding path program 1 times [2024-11-07 20:25:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373093823] [2024-11-07 20:25:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,652 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-07 20:25:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373093823] [2024-11-07 20:25:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373093823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:35,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:35,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268647956] [2024-11-07 20:25:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:35,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:25:35,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:25:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:25:35,675 INFO L87 Difference]: Start difference. First operand has 215 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 204 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:35,698 INFO L93 Difference]: Finished difference Result 416 states and 465 transitions. [2024-11-07 20:25:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:25:35,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-07 20:25:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:35,706 INFO L225 Difference]: With dead ends: 416 [2024-11-07 20:25:35,706 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 20:25:35,709 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-07 20:25:35,712 INFO L432 NwaCegarLoop]: 212 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, 212 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 20:25:35,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 20:25:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-07 20:25:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 188 states have internal predecessors, (191), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2024-11-07 20:25:35,758 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 14 [2024-11-07 20:25:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:35,760 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2024-11-07 20:25:35,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2024-11-07 20:25:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:25:35,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:35,761 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:35,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:25:35,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:35,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:35,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1832392121, now seen corresponding path program 1 times [2024-11-07 20:25:35,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758706221] [2024-11-07 20:25:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,852 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-07 20:25:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758706221] [2024-11-07 20:25:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758706221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91978292] [2024-11-07 20:25:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:35,854 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:35,921 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2024-11-07 20:25:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:35,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-07 20:25:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:35,924 INFO L225 Difference]: With dead ends: 198 [2024-11-07 20:25:35,924 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 20:25:35,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:35,926 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:35,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 353 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 20:25:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-07 20:25:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 107 states have (on average 1.7476635514018692) internal successors, (187), 184 states have internal predecessors, (187), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2024-11-07 20:25:35,942 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 14 [2024-11-07 20:25:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:35,943 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2024-11-07 20:25:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2024-11-07 20:25:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:25:35,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:35,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:35,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:25:35,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:35,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash -969580864, now seen corresponding path program 1 times [2024-11-07 20:25:35,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:35,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022961503] [2024-11-07 20:25:35,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:35,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:36,008 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-07 20:25:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:36,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022961503] [2024-11-07 20:25:36,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022961503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834209439] [2024-11-07 20:25:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:36,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:36,010 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:36,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:36,058 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2024-11-07 20:25:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-07 20:25:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:36,061 INFO L225 Difference]: With dead ends: 194 [2024-11-07 20:25:36,061 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 20:25:36,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:36,062 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:36,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 353 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 20:25:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-07 20:25:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 107 states have (on average 1.7102803738317758) internal successors, (183), 180 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 197 transitions. [2024-11-07 20:25:36,072 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 197 transitions. Word has length 15 [2024-11-07 20:25:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 197 transitions. [2024-11-07 20:25:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 197 transitions. [2024-11-07 20:25:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 20:25:36,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:36,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:36,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:25:36,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:36,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -621065980, now seen corresponding path program 1 times [2024-11-07 20:25:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:36,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126225749] [2024-11-07 20:25:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764063572] [2024-11-07 20:25:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:36,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:36,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:36,093 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 20:25:36,096 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 20:25:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:36,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:25:36,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 20:25:36,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126225749] [2024-11-07 20:25:36,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764063572] [2024-11-07 20:25:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764063572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:25:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034725777] [2024-11-07 20:25:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:36,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:36,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:36,220 INFO L87 Difference]: Start difference. First operand 190 states and 197 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:25:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:36,306 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-11-07 20:25:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-07 20:25:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:36,308 INFO L225 Difference]: With dead ends: 190 [2024-11-07 20:25:36,308 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 20:25:36,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:36,309 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 8 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:36,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 683 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 20:25:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 20:25:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 107 states have (on average 1.691588785046729) internal successors, (181), 178 states have internal predecessors, (181), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2024-11-07 20:25:36,321 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 19 [2024-11-07 20:25:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:36,321 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2024-11-07 20:25:36,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:25:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2024-11-07 20:25:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 20:25:36,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:36,326 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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 20:25:36,341 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 20:25:36,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:36,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:36,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1742643569, now seen corresponding path program 1 times [2024-11-07 20:25:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369052915] [2024-11-07 20:25:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:36,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489783416] [2024-11-07 20:25:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:36,581 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 20:25:36,582 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 20:25:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:36,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:25:36,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:36,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369052915] [2024-11-07 20:25:36,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489783416] [2024-11-07 20:25:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489783416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:36,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:25:36,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-07 20:25:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081524526] [2024-11-07 20:25:36,759 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:36,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:36,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:36,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:36,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:36,760 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:25:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:36,840 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2024-11-07 20:25:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:36,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-07 20:25:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:36,841 INFO L225 Difference]: With dead ends: 188 [2024-11-07 20:25:36,841 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 20:25:36,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:36,841 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 144 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:36,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 476 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 20:25:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-07 20:25:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 107 states have (on average 1.6635514018691588) internal successors, (178), 175 states have internal predecessors, (178), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2024-11-07 20:25:36,847 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 36 [2024-11-07 20:25:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:36,847 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2024-11-07 20:25:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:25:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2024-11-07 20:25:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 20:25:36,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:36,848 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 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 20:25:36,860 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 20:25:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:37,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1812624144, now seen corresponding path program 1 times [2024-11-07 20:25:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250446799] [2024-11-07 20:25:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250446799] [2024-11-07 20:25:37,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250446799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575240069] [2024-11-07 20:25:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:37,295 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 20:25:37,296 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 20:25:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 20:25:37,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:37,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575240069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:25:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 20:25:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18506774] [2024-11-07 20:25:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:37,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:25:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:25:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:25:37,392 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:37,515 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2024-11-07 20:25:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:25:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-07 20:25:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:37,517 INFO L225 Difference]: With dead ends: 185 [2024-11-07 20:25:37,517 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 20:25:37,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:25:37,517 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:37,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 611 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 20:25:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-07 20:25:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 107 states have (on average 1.6542056074766356) internal successors, (177), 174 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2024-11-07 20:25:37,523 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 37 [2024-11-07 20:25:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:37,523 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2024-11-07 20:25:37,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2024-11-07 20:25:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 20:25:37,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:37,524 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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 20:25:37,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 20:25:37,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:37,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1824922162, now seen corresponding path program 1 times [2024-11-07 20:25:37,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477868188] [2024-11-07 20:25:37,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477868188] [2024-11-07 20:25:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477868188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750993079] [2024-11-07 20:25:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:37,784 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:37,835 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-11-07 20:25:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-07 20:25:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:37,836 INFO L225 Difference]: With dead ends: 190 [2024-11-07 20:25:37,836 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 20:25:37,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 20:25:37,837 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:37,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 221 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 20:25:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-07 20:25:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-11-07 20:25:37,843 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 39 [2024-11-07 20:25:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:37,843 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-11-07 20:25:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-11-07 20:25:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 20:25:37,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:37,844 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 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 20:25:37,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:25:37,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:37,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash 738012252, now seen corresponding path program 1 times [2024-11-07 20:25:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781144352] [2024-11-07 20:25:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:37,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:37,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781144352] [2024-11-07 20:25:37,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781144352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:37,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:37,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:25:37,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241429950] [2024-11-07 20:25:37,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:37,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:25:37,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:37,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:25:37,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:37,884 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:37,976 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2024-11-07 20:25:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:25:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-07 20:25:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:37,977 INFO L225 Difference]: With dead ends: 191 [2024-11-07 20:25:37,977 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 20:25:37,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:37,978 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:37,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 335 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 20:25:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 20:25:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 113 states have (on average 1.6017699115044248) internal successors, (181), 178 states have internal predecessors, (181), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2024-11-07 20:25:37,984 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 40 [2024-11-07 20:25:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:37,984 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2024-11-07 20:25:37,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:37,984 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2024-11-07 20:25:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 20:25:37,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:37,985 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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 20:25:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:25:37,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:37,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1403543412, now seen corresponding path program 1 times [2024-11-07 20:25:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303579723] [2024-11-07 20:25:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:37,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893866990] [2024-11-07 20:25:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:37,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:37,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:38,001 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 20:25:38,002 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 20:25:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 20:25:38,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:38,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:38,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303579723] [2024-11-07 20:25:38,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:38,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893866990] [2024-11-07 20:25:38,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893866990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:38,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:38,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:38,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698246564] [2024-11-07 20:25:38,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:38,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:38,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:38,049 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:38,122 INFO L93 Difference]: Finished difference Result 294 states and 314 transitions. [2024-11-07 20:25:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-07 20:25:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:38,124 INFO L225 Difference]: With dead ends: 294 [2024-11-07 20:25:38,124 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 20:25:38,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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 20:25:38,124 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 97 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:38,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 308 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 20:25:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 251. [2024-11-07 20:25:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 173 states have (on average 1.6358381502890174) internal successors, (283), 238 states have internal predecessors, (283), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 20:25:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 303 transitions. [2024-11-07 20:25:38,132 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 303 transitions. Word has length 41 [2024-11-07 20:25:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 303 transitions. [2024-11-07 20:25:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 303 transitions. [2024-11-07 20:25:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 20:25:38,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:38,134 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 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 20:25:38,146 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-07 20:25:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 20:25:38,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 560172894, now seen corresponding path program 1 times [2024-11-07 20:25:38,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689551701] [2024-11-07 20:25:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:25:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689551701] [2024-11-07 20:25:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689551701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003593547] [2024-11-07 20:25:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:38,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:38,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:38,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:25:38,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 20:25:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:38,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 20:25:38,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:38,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:39,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003593547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:39,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:25:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-07 20:25:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733190176] [2024-11-07 20:25:39,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 20:25:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 20:25:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:25:39,007 INFO L87 Difference]: Start difference. First operand 251 states and 303 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-07 20:25:39,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:39,394 INFO L93 Difference]: Finished difference Result 392 states and 423 transitions. [2024-11-07 20:25:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:25:39,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 42 [2024-11-07 20:25:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:39,396 INFO L225 Difference]: With dead ends: 392 [2024-11-07 20:25:39,396 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 20:25:39,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2024-11-07 20:25:39,397 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 587 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:39,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1131 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:25:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 20:25:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 295. [2024-11-07 20:25:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.6325581395348838) internal successors, (351), 280 states have internal predecessors, (351), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 20:25:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 375 transitions. [2024-11-07 20:25:39,417 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 375 transitions. Word has length 42 [2024-11-07 20:25:39,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 375 transitions. [2024-11-07 20:25:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-07 20:25:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 375 transitions. [2024-11-07 20:25:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 20:25:39,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:39,419 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:25:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 20:25:39,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 20:25:39,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:39,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:39,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1455241824, now seen corresponding path program 1 times [2024-11-07 20:25:39,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:39,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172739509] [2024-11-07 20:25:39,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:39,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:39,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443948808] [2024-11-07 20:25:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:39,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:39,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:39,636 INFO L229 MonitoredProcess]: Starting monitored process 7 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 20:25:39,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 20:25:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:39,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 20:25:39,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:39,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172739509] [2024-11-07 20:25:39,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:39,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443948808] [2024-11-07 20:25:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443948808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:25:39,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:25:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 20:25:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702359262] [2024-11-07 20:25:39,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:39,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 20:25:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 20:25:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:25:39,942 INFO L87 Difference]: Start difference. First operand 295 states and 375 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:25:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:40,480 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2024-11-07 20:25:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:25:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2024-11-07 20:25:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:40,482 INFO L225 Difference]: With dead ends: 429 [2024-11-07 20:25:40,483 INFO L226 Difference]: Without dead ends: 402 [2024-11-07 20:25:40,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:25:40,484 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 311 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 517 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 20:25:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-07 20:25:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 376. [2024-11-07 20:25:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 310 states have (on average 1.4387096774193548) internal successors, (446), 358 states have internal predecessors, (446), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 20:25:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 476 transitions. [2024-11-07 20:25:40,510 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 476 transitions. Word has length 44 [2024-11-07 20:25:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:40,510 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 476 transitions. [2024-11-07 20:25:40,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:25:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 476 transitions. [2024-11-07 20:25:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 20:25:40,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:40,511 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:25:40,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 20:25:40,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 20:25:40,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1671942814, now seen corresponding path program 1 times [2024-11-07 20:25:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349484733] [2024-11-07 20:25:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944694899] [2024-11-07 20:25:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:40,727 INFO L229 MonitoredProcess]: Starting monitored process 8 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 20:25:40,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 20:25:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:40,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:25:40,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:40,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:40,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349484733] [2024-11-07 20:25:40,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:40,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944694899] [2024-11-07 20:25:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944694899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:40,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013681300] [2024-11-07 20:25:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:40,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:40,778 INFO L87 Difference]: Start difference. First operand 376 states and 476 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:41,028 INFO L93 Difference]: Finished difference Result 577 states and 730 transitions. [2024-11-07 20:25:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:41,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-11-07 20:25:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:41,030 INFO L225 Difference]: With dead ends: 577 [2024-11-07 20:25:41,030 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 20:25:41,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 20:25:41,031 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:41,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 210 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:25:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 20:25:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 524. [2024-11-07 20:25:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.346578366445916) internal successors, (610), 501 states have internal predecessors, (610), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 650 transitions. [2024-11-07 20:25:41,047 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 650 transitions. Word has length 46 [2024-11-07 20:25:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:41,047 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 650 transitions. [2024-11-07 20:25:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2024-11-07 20:25:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 20:25:41,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:41,048 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:41,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 20:25:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:41,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -510342249, now seen corresponding path program 1 times [2024-11-07 20:25:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409471229] [2024-11-07 20:25:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409471229] [2024-11-07 20:25:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409471229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:25:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221676531] [2024-11-07 20:25:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:25:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:41,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:25:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:41,319 INFO L87 Difference]: Start difference. First operand 524 states and 650 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:41,616 INFO L93 Difference]: Finished difference Result 537 states and 651 transitions. [2024-11-07 20:25:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:25:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2024-11-07 20:25:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:41,618 INFO L225 Difference]: With dead ends: 537 [2024-11-07 20:25:41,618 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 20:25:41,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:41,619 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:41,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:25:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 20:25:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 524. [2024-11-07 20:25:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3421633554083885) internal successors, (608), 501 states have internal predecessors, (608), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 648 transitions. [2024-11-07 20:25:41,635 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 648 transitions. Word has length 88 [2024-11-07 20:25:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 648 transitions. [2024-11-07 20:25:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 648 transitions. [2024-11-07 20:25:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 20:25:41,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:41,636 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:41,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 20:25:41,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1359259636, now seen corresponding path program 1 times [2024-11-07 20:25:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497319402] [2024-11-07 20:25:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497319402] [2024-11-07 20:25:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497319402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:25:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017029547] [2024-11-07 20:25:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:41,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:41,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:41,740 INFO L87 Difference]: Start difference. First operand 524 states and 648 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:42,021 INFO L93 Difference]: Finished difference Result 534 states and 654 transitions. [2024-11-07 20:25:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2024-11-07 20:25:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:42,024 INFO L225 Difference]: With dead ends: 534 [2024-11-07 20:25:42,024 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 20:25:42,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:42,024 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 252 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:42,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 229 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:25:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 20:25:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2024-11-07 20:25:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3377483443708609) internal successors, (606), 501 states have internal predecessors, (606), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 646 transitions. [2024-11-07 20:25:42,040 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 646 transitions. Word has length 89 [2024-11-07 20:25:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:42,041 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 646 transitions. [2024-11-07 20:25:42,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 646 transitions. [2024-11-07 20:25:42,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 20:25:42,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:42,041 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 20:25:42,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:42,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1847120568, now seen corresponding path program 1 times [2024-11-07 20:25:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:42,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257041211] [2024-11-07 20:25:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257041211] [2024-11-07 20:25:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257041211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769474239] [2024-11-07 20:25:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:42,163 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:25:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 20:25:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:42,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:25:42,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:42,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769474239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:25:42,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:25:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-07 20:25:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147965348] [2024-11-07 20:25:42,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:25:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:25:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-07 20:25:42,527 INFO L87 Difference]: Start difference. First operand 524 states and 646 transitions. Second operand has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 20:25:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:43,251 INFO L93 Difference]: Finished difference Result 1138 states and 1404 transitions. [2024-11-07 20:25:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 20:25:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 93 [2024-11-07 20:25:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:43,254 INFO L225 Difference]: With dead ends: 1138 [2024-11-07 20:25:43,254 INFO L226 Difference]: Without dead ends: 639 [2024-11-07 20:25:43,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-07 20:25:43,256 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1000 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:43,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 406 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 20:25:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-07 20:25:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 601. [2024-11-07 20:25:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 528 states have (on average 1.3181818181818181) internal successors, (696), 574 states have internal predecessors, (696), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:25:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 744 transitions. [2024-11-07 20:25:43,274 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 744 transitions. Word has length 93 [2024-11-07 20:25:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 744 transitions. [2024-11-07 20:25:43,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 20:25:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 744 transitions. [2024-11-07 20:25:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 20:25:43,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:43,275 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:43,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 20:25:43,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 20:25:43,476 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:43,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1426162889, now seen corresponding path program 1 times [2024-11-07 20:25:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:43,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477083200] [2024-11-07 20:25:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477083200] [2024-11-07 20:25:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477083200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625551649] [2024-11-07 20:25:43,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:43,562 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:25:43,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 20:25:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:43,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:25:43,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:53,785 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-11-07 20:25:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2024-11-07 20:25:53,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625551649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:25:53,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:25:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-07 20:25:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90032739] [2024-11-07 20:25:53,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:53,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:25:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:25:53,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=4, NotChecked=22, Total=182 [2024-11-07 20:25:53,937 INFO L87 Difference]: Start difference. First operand 601 states and 744 transitions. Second operand has 14 states, 13 states have (on average 13.384615384615385) internal successors, (174), 14 states have internal predecessors, (174), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-07 20:25:54,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:25:58,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:17,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:18,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:19,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:22,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:24,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:28,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:29,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:33,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:37,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:43,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:47,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:48,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:49,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:53,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:54,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:55,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:59,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:01,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:05,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:09,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:13,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:17,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:18,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:19,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]