./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:26:36,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:26:36,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 23:26:36,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:26:36,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:26:36,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:26:36,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:26:36,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:26:36,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:26:36,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:26:36,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:26:36,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:26:36,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:26:36,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:26:36,849 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:26:36,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:26:36,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:26:36,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 23:26:36,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:26:36,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 23:26:36,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:26:36,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:26:36,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:26:36,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:26:36,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:26:36,854 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:26:36,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:26:36,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 23:26:36,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:26:36,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:26:36,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:26:36,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:26:36,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:26:36,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:26:36,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:26:36,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:26:36,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:26:36,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:26:36,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:26:36,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:26:36,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:26:36,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:26:36,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:26:36,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:26:36,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-10-11 23:26:37,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:26:37,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:26:37,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:26:37,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:26:37,175 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:26:37,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 23:26:38,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:26:38,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:26:38,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2024-10-11 23:26:38,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e552cdd3/3c8cd37705e5468caa6b5d2d9483e5c3/FLAG7bb240be7 [2024-10-11 23:26:38,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3e552cdd3/3c8cd37705e5468caa6b5d2d9483e5c3 [2024-10-11 23:26:38,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:26:38,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:26:38,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:26:38,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:26:38,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:26:38,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:26:38" (1/1) ... [2024-10-11 23:26:38,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc3f64d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:38, skipping insertion in model container [2024-10-11 23:26:38,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:26:38" (1/1) ... [2024-10-11 23:26:38,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:26:39,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:26:39,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:26:39,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:26:39,729 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:26:39,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39 WrapperNode [2024-10-11 23:26:39,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:26:39,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:26:39,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:26:39,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:26:39,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:39,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:39,855 INFO L138 Inliner]: procedures = 177, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1608 [2024-10-11 23:26:39,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:26:39,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:26:39,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:26:39,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:26:39,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:39,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:39,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,025 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [266, 2, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 62 writes are split as follows [58, 0, 4]. [2024-10-11 23:26:40,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:26:40,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:26:40,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:26:40,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:26:40,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 23:26:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:26:40,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:40,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:26:40,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:26:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 23:26:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 23:26:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 23:26:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 23:26:40,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 23:26:40,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 23:26:40,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 23:26:40,336 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 23:26:40,337 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 23:26:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 23:26:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:26:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 23:26:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 23:26:40,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 23:26:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 23:26:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 23:26:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 23:26:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:26:40,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:26:40,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:26:40,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:26:42,174 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2024-10-11 23:26:42,175 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:26:42,224 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:26:42,225 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-11 23:26:42,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:26:42 BoogieIcfgContainer [2024-10-11 23:26:42,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:26:42,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:26:42,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:26:42,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:26:42,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:26:38" (1/3) ... [2024-10-11 23:26:42,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6915d373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:26:42, skipping insertion in model container [2024-10-11 23:26:42,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (2/3) ... [2024-10-11 23:26:42,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6915d373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:26:42, skipping insertion in model container [2024-10-11 23:26:42,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:26:42" (3/3) ... [2024-10-11 23:26:42,234 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-2.i [2024-10-11 23:26:42,251 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:26:42,252 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 23:26:42,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:26:42,343 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;@265af2f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:26:42,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 23:26:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 444 states, 430 states have (on average 1.6325581395348838) internal successors, (702), 437 states have internal predecessors, (702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:26:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 23:26:42,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:42,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:42,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash -123256555, now seen corresponding path program 1 times [2024-10-11 23:26:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199209493] [2024-10-11 23:26:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199209493] [2024-10-11 23:26:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199209493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:26:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046983973] [2024-10-11 23:26:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:42,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 23:26:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 23:26:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 23:26:42,598 INFO L87 Difference]: Start difference. First operand has 444 states, 430 states have (on average 1.6325581395348838) internal successors, (702), 437 states have internal predecessors, (702), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:42,698 INFO L93 Difference]: Finished difference Result 885 states and 1422 transitions. [2024-10-11 23:26:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 23:26:42,701 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 23:26:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:42,715 INFO L225 Difference]: With dead ends: 885 [2024-10-11 23:26:42,716 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 23:26:42,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10-11 23:26:42,726 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:42,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:26:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 23:26:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-10-11 23:26:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 395 states have internal predecessors, (567), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:26:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 575 transitions. [2024-10-11 23:26:42,809 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 575 transitions. Word has length 7 [2024-10-11 23:26:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:42,810 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 575 transitions. [2024-10-11 23:26:42,810 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 575 transitions. [2024-10-11 23:26:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 23:26:42,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:42,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:42,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:26:42,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:42,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash -123254633, now seen corresponding path program 1 times [2024-10-11 23:26:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:42,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290041257] [2024-10-11 23:26:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 23:26:42,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975144323] [2024-10-11 23:26:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:42,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:42,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:42,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 23:26:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:43,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 23:26:43,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:26:43,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 23:26:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:43,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:26:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290041257] [2024-10-11 23:26:43,205 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 23:26:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975144323] [2024-10-11 23:26:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975144323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:26:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537613872] [2024-10-11 23:26:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:43,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:26:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:26:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:26:43,210 INFO L87 Difference]: Start difference. First operand 401 states and 575 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:43,389 INFO L93 Difference]: Finished difference Result 793 states and 1142 transitions. [2024-10-11 23:26:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:26:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 23:26:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:43,394 INFO L225 Difference]: With dead ends: 793 [2024-10-11 23:26:43,395 INFO L226 Difference]: Without dead ends: 791 [2024-10-11 23:26:43,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:26:43,397 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 552 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1731 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:26:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-11 23:26:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 407. [2024-10-11 23:26:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 395 states have (on average 1.4531645569620253) internal successors, (574), 401 states have internal predecessors, (574), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:26:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 582 transitions. [2024-10-11 23:26:43,432 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 582 transitions. Word has length 7 [2024-10-11 23:26:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 582 transitions. [2024-10-11 23:26:43,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 582 transitions. [2024-10-11 23:26:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 23:26:43,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:43,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:43,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:26:43,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:43,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash -99934232, now seen corresponding path program 1 times [2024-10-11 23:26:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:43,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166337807] [2024-10-11 23:26:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:26:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:44,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:44,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166337807] [2024-10-11 23:26:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166337807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:44,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:26:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751817885] [2024-10-11 23:26:44,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:44,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:26:44,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:44,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:26:44,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:26:44,035 INFO L87 Difference]: Start difference. First operand 407 states and 582 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:26:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:44,137 INFO L93 Difference]: Finished difference Result 557 states and 794 transitions. [2024-10-11 23:26:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:26:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-10-11 23:26:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:44,140 INFO L225 Difference]: With dead ends: 557 [2024-10-11 23:26:44,140 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 23:26:44,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:26:44,142 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 30 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:44,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1396 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:26:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 23:26:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-10-11 23:26:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 353 states have (on average 1.4079320113314449) internal successors, (497), 359 states have internal predecessors, (497), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 23:26:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 505 transitions. [2024-10-11 23:26:44,161 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 505 transitions. Word has length 70 [2024-10-11 23:26:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:44,161 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 505 transitions. [2024-10-11 23:26:44,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:26:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 505 transitions. [2024-10-11 23:26:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 23:26:44,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:44,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:44,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:26:44,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1933671204, now seen corresponding path program 1 times [2024-10-11 23:26:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398414239] [2024-10-11 23:26:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:26:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:44,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:44,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398414239] [2024-10-11 23:26:44,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398414239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:44,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:44,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:26:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910380267] [2024-10-11 23:26:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:26:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:44,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:26:44,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:26:44,332 INFO L87 Difference]: Start difference. First operand 365 states and 505 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:26:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:44,354 INFO L93 Difference]: Finished difference Result 515 states and 706 transitions. [2024-10-11 23:26:44,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:26:44,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-10-11 23:26:44,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:44,357 INFO L225 Difference]: With dead ends: 515 [2024-10-11 23:26:44,358 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 23:26:44,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-11 23:26:44,359 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 0 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:44,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:26:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 23:26:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-11 23:26:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 350 states have (on average 1.4085714285714286) internal successors, (493), 355 states have internal predecessors, (493), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:26:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 499 transitions. [2024-10-11 23:26:44,374 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 499 transitions. Word has length 70 [2024-10-11 23:26:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:44,375 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 499 transitions. [2024-10-11 23:26:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:26:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 499 transitions. [2024-10-11 23:26:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 23:26:44,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:44,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:26:44,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1955930481, now seen corresponding path program 1 times [2024-10-11 23:26:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144787977] [2024-10-11 23:26:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:44,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144787977] [2024-10-11 23:26:44,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144787977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:26:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373601046] [2024-10-11 23:26:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:26:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:26:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:26:44,506 INFO L87 Difference]: Start difference. First operand 360 states and 499 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:44,541 INFO L93 Difference]: Finished difference Result 512 states and 702 transitions. [2024-10-11 23:26:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:26:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-11 23:26:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:44,545 INFO L225 Difference]: With dead ends: 512 [2024-10-11 23:26:44,545 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 23:26:44,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:26:44,546 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 15 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:44,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 941 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:26:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 23:26:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-11 23:26:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 350 states have (on average 1.3971428571428572) internal successors, (489), 355 states have internal predecessors, (489), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:26:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 495 transitions. [2024-10-11 23:26:44,561 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 495 transitions. Word has length 71 [2024-10-11 23:26:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:44,563 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 495 transitions. [2024-10-11 23:26:44,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 495 transitions. [2024-10-11 23:26:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:26:44,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:44,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:26:44,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:44,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash -485282061, now seen corresponding path program 1 times [2024-10-11 23:26:44,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:44,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696329821] [2024-10-11 23:26:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:44,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696329821] [2024-10-11 23:26:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696329821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:44,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:26:44,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115889510] [2024-10-11 23:26:44,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:44,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:26:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:26:44,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:26:44,846 INFO L87 Difference]: Start difference. First operand 360 states and 495 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:44,926 INFO L93 Difference]: Finished difference Result 670 states and 915 transitions. [2024-10-11 23:26:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:26:44,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:26:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:44,930 INFO L225 Difference]: With dead ends: 670 [2024-10-11 23:26:44,930 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 23:26:44,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:26:44,931 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 36 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:44,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1113 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:26:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 23:26:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-10-11 23:26:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 308 states have (on average 1.3376623376623376) internal successors, (412), 313 states have internal predecessors, (412), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:26:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2024-10-11 23:26:44,943 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 81 [2024-10-11 23:26:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:44,943 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2024-10-11 23:26:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2024-10-11 23:26:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:26:44,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:44,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:26:44,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -260747681, now seen corresponding path program 1 times [2024-10-11 23:26:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885323203] [2024-10-11 23:26:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:44,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885323203] [2024-10-11 23:26:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885323203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:45,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:26:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240994540] [2024-10-11 23:26:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:45,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:26:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:26:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:26:45,140 INFO L87 Difference]: Start difference. First operand 318 states and 418 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:45,209 INFO L93 Difference]: Finished difference Result 622 states and 821 transitions. [2024-10-11 23:26:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:26:45,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:26:45,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:45,211 INFO L225 Difference]: With dead ends: 622 [2024-10-11 23:26:45,211 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 23:26:45,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:26:45,213 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 9 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:45,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1114 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:26:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 23:26:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-10-11 23:26:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 302 states have (on average 1.3311258278145695) internal successors, (402), 307 states have internal predecessors, (402), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:26:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 408 transitions. [2024-10-11 23:26:45,220 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 408 transitions. Word has length 81 [2024-10-11 23:26:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:45,221 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 408 transitions. [2024-10-11 23:26:45,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 408 transitions. [2024-10-11 23:26:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 23:26:45,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:45,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:26:45,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 161778791, now seen corresponding path program 1 times [2024-10-11 23:26:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337741562] [2024-10-11 23:26:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:45,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:26:45,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:45,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337741562] [2024-10-11 23:26:45,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337741562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:45,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:45,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:26:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587177834] [2024-10-11 23:26:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:45,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:26:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:26:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:26:45,387 INFO L87 Difference]: Start difference. First operand 312 states and 408 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:45,464 INFO L93 Difference]: Finished difference Result 791 states and 1041 transitions. [2024-10-11 23:26:45,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:26:45,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 23:26:45,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:45,468 INFO L225 Difference]: With dead ends: 791 [2024-10-11 23:26:45,468 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 23:26:45,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:26:45,470 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 175 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:45,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 763 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:26:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 23:26:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2024-10-11 23:26:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 392 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 23:26:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 520 transitions. [2024-10-11 23:26:45,484 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 520 transitions. Word has length 81 [2024-10-11 23:26:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:45,485 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 520 transitions. [2024-10-11 23:26:45,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 23:26:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 520 transitions. [2024-10-11 23:26:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 23:26:45,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:45,486 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:45,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:26:45,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:45,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -379763128, now seen corresponding path program 1 times [2024-10-11 23:26:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939293537] [2024-10-11 23:26:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 23:26:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:26:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939293537] [2024-10-11 23:26:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939293537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:45,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:26:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080174767] [2024-10-11 23:26:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:26:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:45,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:26:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 23:26:45,989 INFO L87 Difference]: Start difference. First operand 397 states and 520 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:46,332 INFO L93 Difference]: Finished difference Result 616 states and 812 transitions. [2024-10-11 23:26:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:26:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-10-11 23:26:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:46,337 INFO L225 Difference]: With dead ends: 616 [2024-10-11 23:26:46,337 INFO L226 Difference]: Without dead ends: 614 [2024-10-11 23:26:46,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:26:46,338 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 294 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:46,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1439 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:26:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-11 23:26:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 461. [2024-10-11 23:26:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 448 states have (on average 1.3214285714285714) internal successors, (592), 453 states have internal predecessors, (592), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 604 transitions. [2024-10-11 23:26:46,354 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 604 transitions. Word has length 94 [2024-10-11 23:26:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:46,355 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 604 transitions. [2024-10-11 23:26:46,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 604 transitions. [2024-10-11 23:26:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 23:26:46,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:46,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:46,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:26:46,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -322507865, now seen corresponding path program 1 times [2024-10-11 23:26:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279617787] [2024-10-11 23:26:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 23:26:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:26:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:26:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279617787] [2024-10-11 23:26:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279617787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:26:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67336478] [2024-10-11 23:26:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:46,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:46,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:46,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 23:26:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:47,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 23:26:47,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:26:47,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 23:26:47,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 23:26:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 23:26:47,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 23:26:47,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-10-11 23:26:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:48,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:26:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67336478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:26:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 23:26:48,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493500581] [2024-10-11 23:26:48,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:48,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 23:26:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 23:26:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 23:26:48,189 INFO L87 Difference]: Start difference. First operand 461 states and 604 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:49,470 INFO L93 Difference]: Finished difference Result 1033 states and 1363 transitions. [2024-10-11 23:26:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 23:26:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-10-11 23:26:49,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:49,474 INFO L225 Difference]: With dead ends: 1033 [2024-10-11 23:26:49,474 INFO L226 Difference]: Without dead ends: 612 [2024-10-11 23:26:49,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-11 23:26:49,475 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 474 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:49,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2418 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 23:26:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-11 23:26:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 461. [2024-10-11 23:26:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 448 states have (on average 1.3191964285714286) internal successors, (591), 453 states have internal predecessors, (591), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 603 transitions. [2024-10-11 23:26:49,488 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 603 transitions. Word has length 100 [2024-10-11 23:26:49,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:49,489 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 603 transitions. [2024-10-11 23:26:49,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 603 transitions. [2024-10-11 23:26:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 23:26:49,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:49,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:49,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 23:26:49,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:49,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1411559168, now seen corresponding path program 1 times [2024-10-11 23:26:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689626313] [2024-10-11 23:26:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:50,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 23:26:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 23:26:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:26:50,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:50,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689626313] [2024-10-11 23:26:50,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689626313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:26:50,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27347249] [2024-10-11 23:26:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:50,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:50,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:50,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:50,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 23:26:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:50,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 23:26:50,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:26:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:50,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:26:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27347249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:26:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 23:26:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552667198] [2024-10-11 23:26:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 23:26:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 23:26:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 23:26:50,849 INFO L87 Difference]: Start difference. First operand 461 states and 603 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:51,208 INFO L93 Difference]: Finished difference Result 892 states and 1180 transitions. [2024-10-11 23:26:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:26:51,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2024-10-11 23:26:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:51,212 INFO L225 Difference]: With dead ends: 892 [2024-10-11 23:26:51,212 INFO L226 Difference]: Without dead ends: 471 [2024-10-11 23:26:51,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 23:26:51,213 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 11 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:51,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1921 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:26:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-10-11 23:26:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 469. [2024-10-11 23:26:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 456 states have (on average 1.3135964912280702) internal successors, (599), 461 states have internal predecessors, (599), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 611 transitions. [2024-10-11 23:26:51,233 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 611 transitions. Word has length 101 [2024-10-11 23:26:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:51,233 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 611 transitions. [2024-10-11 23:26:51,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 611 transitions. [2024-10-11 23:26:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 23:26:51,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:51,235 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:51,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 23:26:51,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:51,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash -42571507, now seen corresponding path program 1 times [2024-10-11 23:26:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425796732] [2024-10-11 23:26:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:26:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 23:26:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425796732] [2024-10-11 23:26:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425796732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 23:26:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910185657] [2024-10-11 23:26:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 23:26:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 23:26:51,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:26:51,834 INFO L87 Difference]: Start difference. First operand 469 states and 611 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:52,245 INFO L93 Difference]: Finished difference Result 903 states and 1194 transitions. [2024-10-11 23:26:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:26:52,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-10-11 23:26:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:52,248 INFO L225 Difference]: With dead ends: 903 [2024-10-11 23:26:52,248 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 23:26:52,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:26:52,251 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 6 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:52,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1635 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 23:26:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 23:26:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2024-10-11 23:26:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 462 states have (on average 1.3095238095238095) internal successors, (605), 467 states have internal predecessors, (605), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 617 transitions. [2024-10-11 23:26:52,272 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 617 transitions. Word has length 103 [2024-10-11 23:26:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:52,273 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 617 transitions. [2024-10-11 23:26:52,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 617 transitions. [2024-10-11 23:26:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 23:26:52,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:52,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:52,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 23:26:52,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:52,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1472592377, now seen corresponding path program 1 times [2024-10-11 23:26:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879090842] [2024-10-11 23:26:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:26:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 23:26:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879090842] [2024-10-11 23:26:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879090842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 23:26:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773184388] [2024-10-11 23:26:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:52,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 23:26:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 23:26:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 23:26:52,659 INFO L87 Difference]: Start difference. First operand 475 states and 617 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:53,172 INFO L93 Difference]: Finished difference Result 905 states and 1193 transitions. [2024-10-11 23:26:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 23:26:53,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-10-11 23:26:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:53,175 INFO L225 Difference]: With dead ends: 905 [2024-10-11 23:26:53,175 INFO L226 Difference]: Without dead ends: 487 [2024-10-11 23:26:53,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 23:26:53,178 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 10 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:53,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2214 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 23:26:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-11 23:26:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 475. [2024-10-11 23:26:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 462 states have (on average 1.3095238095238095) internal successors, (605), 467 states have internal predecessors, (605), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 617 transitions. [2024-10-11 23:26:53,193 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 617 transitions. Word has length 103 [2024-10-11 23:26:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:53,193 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 617 transitions. [2024-10-11 23:26:53,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 617 transitions. [2024-10-11 23:26:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 23:26:53,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:53,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:53,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 23:26:53,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:53,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash -368651242, now seen corresponding path program 1 times [2024-10-11 23:26:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574663625] [2024-10-11 23:26:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:53,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:26:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 23:26:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:53,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574663625] [2024-10-11 23:26:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574663625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:53,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:53,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 23:26:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602400478] [2024-10-11 23:26:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:53,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 23:26:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:53,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 23:26:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 23:26:53,625 INFO L87 Difference]: Start difference. First operand 475 states and 617 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:54,183 INFO L93 Difference]: Finished difference Result 910 states and 1197 transitions. [2024-10-11 23:26:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 23:26:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2024-10-11 23:26:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:54,186 INFO L225 Difference]: With dead ends: 910 [2024-10-11 23:26:54,186 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 23:26:54,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 23:26:54,188 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 18 mSDsluCounter, 2532 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:54,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2903 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 23:26:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 23:26:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 489. [2024-10-11 23:26:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 476 states have (on average 1.3088235294117647) internal successors, (623), 481 states have internal predecessors, (623), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 635 transitions. [2024-10-11 23:26:54,201 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 635 transitions. Word has length 104 [2024-10-11 23:26:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:54,201 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 635 transitions. [2024-10-11 23:26:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 635 transitions. [2024-10-11 23:26:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 23:26:54,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:54,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 23:26:54,204 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash -382448718, now seen corresponding path program 1 times [2024-10-11 23:26:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:54,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506230527] [2024-10-11 23:26:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 23:26:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 23:26:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:26:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506230527] [2024-10-11 23:26:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506230527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:26:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098767920] [2024-10-11 23:26:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:54,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:54,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:54,645 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:54,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 23:26:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:55,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 23:26:55,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:26:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:55,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:26:55,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098767920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:55,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:26:55,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 23:26:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927517711] [2024-10-11 23:26:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:55,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 23:26:55,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:55,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 23:26:55,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 23:26:55,171 INFO L87 Difference]: Start difference. First operand 489 states and 635 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:55,477 INFO L93 Difference]: Finished difference Result 919 states and 1204 transitions. [2024-10-11 23:26:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 23:26:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2024-10-11 23:26:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:55,481 INFO L225 Difference]: With dead ends: 919 [2024-10-11 23:26:55,481 INFO L226 Difference]: Without dead ends: 499 [2024-10-11 23:26:55,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 23:26:55,483 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 32 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:55,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1939 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 23:26:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-11 23:26:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2024-10-11 23:26:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 480 states have (on average 1.30625) internal successors, (627), 485 states have internal predecessors, (627), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 639 transitions. [2024-10-11 23:26:55,499 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 639 transitions. Word has length 104 [2024-10-11 23:26:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:55,499 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 639 transitions. [2024-10-11 23:26:55,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 639 transitions. [2024-10-11 23:26:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 23:26:55,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:55,501 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:55,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 23:26:55,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 23:26:55,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:55,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:55,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2068472237, now seen corresponding path program 1 times [2024-10-11 23:26:55,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:55,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345228907] [2024-10-11 23:26:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:55,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 23:26:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:56,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 23:26:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 23:26:56,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345228907] [2024-10-11 23:26:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345228907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:56,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:26:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 23:26:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314687365] [2024-10-11 23:26:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:56,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 23:26:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:56,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 23:26:56,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 23:26:56,170 INFO L87 Difference]: Start difference. First operand 493 states and 639 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:56,860 INFO L93 Difference]: Finished difference Result 940 states and 1236 transitions. [2024-10-11 23:26:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 23:26:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-11 23:26:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:56,865 INFO L225 Difference]: With dead ends: 940 [2024-10-11 23:26:56,865 INFO L226 Difference]: Without dead ends: 513 [2024-10-11 23:26:56,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 23:26:56,867 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 24 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:56,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2605 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 23:26:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-11 23:26:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 499. [2024-10-11 23:26:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 486 states have (on average 1.3024691358024691) internal successors, (633), 491 states have internal predecessors, (633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:26:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 645 transitions. [2024-10-11 23:26:56,881 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 645 transitions. Word has length 105 [2024-10-11 23:26:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:56,881 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 645 transitions. [2024-10-11 23:26:56,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:26:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 645 transitions. [2024-10-11 23:26:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 23:26:56,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:56,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:56,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 23:26:56,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1640750481, now seen corresponding path program 1 times [2024-10-11 23:26:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404066867] [2024-10-11 23:26:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 23:26:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 23:26:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:26:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404066867] [2024-10-11 23:26:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404066867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:26:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47725780] [2024-10-11 23:26:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:57,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:57,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:57,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 23:26:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:58,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 23:26:58,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:26:58,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 23:26:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:26:58,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:26:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47725780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:26:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:26:58,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2024-10-11 23:26:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197127167] [2024-10-11 23:26:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:26:58,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 23:26:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:26:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 23:26:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 23:26:58,256 INFO L87 Difference]: Start difference. First operand 499 states and 645 transitions. Second operand has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 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-10-11 23:26:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:26:58,384 INFO L93 Difference]: Finished difference Result 891 states and 1160 transitions. [2024-10-11 23:26:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 23:26:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 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 105 [2024-10-11 23:26:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:26:58,388 INFO L225 Difference]: With dead ends: 891 [2024-10-11 23:26:58,388 INFO L226 Difference]: Without dead ends: 501 [2024-10-11 23:26:58,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 23:26:58,389 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 187 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 23:26:58,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 2069 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 23:26:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-11 23:26:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2024-10-11 23:26:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 487 states have (on average 1.3039014373716633) internal successors, (635), 493 states have internal predecessors, (635), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 23:26:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 649 transitions. [2024-10-11 23:26:58,408 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 649 transitions. Word has length 105 [2024-10-11 23:26:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:26:58,408 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 649 transitions. [2024-10-11 23:26:58,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.2) internal successors, (101), 6 states have internal predecessors, (101), 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-10-11 23:26:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 649 transitions. [2024-10-11 23:26:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 23:26:58,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:26:58,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:26:58,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 23:26:58,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 23:26:58,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:26:58,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:26:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1566087343, now seen corresponding path program 1 times [2024-10-11 23:26:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:26:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796303846] [2024-10-11 23:26:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:26:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 23:26:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 23:26:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:26:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 23:26:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:26:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796303846] [2024-10-11 23:26:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796303846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:26:59,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306431844] [2024-10-11 23:26:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:26:59,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:26:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:26:59,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:26:59,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 23:27:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:00,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 23:27:00,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:27:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 23:27:00,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:27:00,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306431844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:27:00,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:27:00,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2024-10-11 23:27:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780877080] [2024-10-11 23:27:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:27:00,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 23:27:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:27:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 23:27:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-10-11 23:27:00,679 INFO L87 Difference]: Start difference. First operand 501 states and 649 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:27:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:27:01,433 INFO L93 Difference]: Finished difference Result 943 states and 1230 transitions. [2024-10-11 23:27:01,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:27:01,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2024-10-11 23:27:01,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:27:01,437 INFO L225 Difference]: With dead ends: 943 [2024-10-11 23:27:01,437 INFO L226 Difference]: Without dead ends: 511 [2024-10-11 23:27:01,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-10-11 23:27:01,439 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 7 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 23:27:01,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3190 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 23:27:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-10-11 23:27:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2024-10-11 23:27:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 493 states have (on average 1.3002028397565923) internal successors, (641), 499 states have internal predecessors, (641), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 23:27:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 655 transitions. [2024-10-11 23:27:01,454 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 655 transitions. Word has length 107 [2024-10-11 23:27:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:27:01,455 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 655 transitions. [2024-10-11 23:27:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:27:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 655 transitions. [2024-10-11 23:27:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 23:27:01,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:27:01,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:27:01,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 23:27:01,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 23:27:01,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:27:01,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:27:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 180144408, now seen corresponding path program 1 times [2024-10-11 23:27:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:27:01,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513774646] [2024-10-11 23:27:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:27:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:27:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:01,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 23:27:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 23:27:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 23:27:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:27:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513774646] [2024-10-11 23:27:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513774646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:27:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319016051] [2024-10-11 23:27:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:27:02,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:27:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:27:02,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:27:02,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 23:27:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:02,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 23:27:02,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:27:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 23:27:02,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:27:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319016051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:27:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:27:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-10-11 23:27:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669375975] [2024-10-11 23:27:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:27:02,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 23:27:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:27:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 23:27:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 23:27:02,789 INFO L87 Difference]: Start difference. First operand 507 states and 655 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:27:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:27:03,169 INFO L93 Difference]: Finished difference Result 952 states and 1244 transitions. [2024-10-11 23:27:03,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:27:03,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2024-10-11 23:27:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:27:03,172 INFO L225 Difference]: With dead ends: 952 [2024-10-11 23:27:03,172 INFO L226 Difference]: Without dead ends: 517 [2024-10-11 23:27:03,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 23:27:03,174 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 6 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 23:27:03,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1928 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 23:27:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-11 23:27:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 507. [2024-10-11 23:27:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 493 states have (on average 1.3002028397565923) internal successors, (641), 499 states have internal predecessors, (641), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-11 23:27:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 655 transitions. [2024-10-11 23:27:03,190 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 655 transitions. Word has length 107 [2024-10-11 23:27:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:27:03,190 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 655 transitions. [2024-10-11 23:27:03,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:27:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 655 transitions. [2024-10-11 23:27:03,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 23:27:03,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:27:03,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:27:03,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 23:27:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:27:03,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 23:27:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:27:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2004714701, now seen corresponding path program 1 times [2024-10-11 23:27:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:27:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817935320] [2024-10-11 23:27:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:27:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:27:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 23:27:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 23:27:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 23:27:03,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:27:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817935320] [2024-10-11 23:27:03,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817935320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:27:03,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534018399] [2024-10-11 23:27:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:27:03,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:27:03,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:27:03,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 23:27:03,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 23:27:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:27:04,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-11 23:27:04,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:27:04,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 23:27:04,607 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-10-11 23:27:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-10-11 23:27:04,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 23:27:04,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 23:27:04,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 23:27:04,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 23:27:04,832 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 23:27:04,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 23:27:04,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13