/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-fpi/sina5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 11:50:45,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 11:50:45,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 11:50:45,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 11:50:45,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 11:50:45,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 11:50:45,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 11:50:45,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 11:50:45,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 11:50:45,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 11:50:45,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 11:50:45,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 11:50:45,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 11:50:45,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 11:50:45,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 11:50:45,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 11:50:45,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 11:50:45,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 11:50:45,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 11:50:45,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 11:50:45,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 11:50:45,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 11:50:45,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 11:50:45,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 11:50:45,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 11:50:45,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 11:50:45,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 11:50:45,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 11:50:45,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 11:50:45,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 11:50:45,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 11:50:45,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 11:50:45,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 11:50:45,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 11:50:45,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 11:50:45,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 11:50:45,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 11:50:45,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 11:50:45,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 11:50:45,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 11:50:45,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 11:50:45,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 11:50:45,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 11:50:45,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 11:50:45,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 11:50:45,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 11:50:45,934 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 11:50:45,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 11:50:45,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 11:50:45,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 11:50:45,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 11:50:45,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 11:50:45,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 11:50:45,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 11:50:45,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:50:45,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 11:50:45,935 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 11:50:45,936 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 11:50:45,936 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 11:50:46,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 11:50:46,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 11:50:46,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 11:50:46,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 11:50:46,201 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 11:50:46,202 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina5.c [2022-01-31 11:50:46,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae7c6b3e/93b61471863d4daabbd96f0dead147df/FLAGcf1e68715 [2022-01-31 11:50:46,640 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 11:50:46,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5.c [2022-01-31 11:50:46,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae7c6b3e/93b61471863d4daabbd96f0dead147df/FLAGcf1e68715 [2022-01-31 11:50:46,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae7c6b3e/93b61471863d4daabbd96f0dead147df [2022-01-31 11:50:46,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 11:50:46,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 11:50:46,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 11:50:46,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 11:50:46,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 11:50:46,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:46,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1081c7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46, skipping insertion in model container [2022-01-31 11:50:46,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:46,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 11:50:46,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 11:50:46,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5.c[588,601] [2022-01-31 11:50:46,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:50:46,925 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 11:50:46,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5.c[588,601] [2022-01-31 11:50:46,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 11:50:46,972 INFO L208 MainTranslator]: Completed translation [2022-01-31 11:50:46,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46 WrapperNode [2022-01-31 11:50:46,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 11:50:46,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 11:50:46,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 11:50:46,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 11:50:46,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:46,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:46,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:46,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:47,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:47,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:47,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:47,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 11:50:47,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 11:50:47,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 11:50:47,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 11:50:47,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (1/1) ... [2022-01-31 11:50:47,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 11:50:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:47,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 11:50:47,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 11:50:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 11:50:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 11:50:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 11:50:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 11:50:47,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 11:50:47,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 11:50:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 11:50:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 11:50:47,098 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 11:50:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 11:50:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 11:50:47,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 11:50:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 11:50:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 11:50:47,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 11:50:47,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 11:50:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 11:50:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 11:50:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 11:50:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 11:50:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 11:50:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 11:50:47,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 11:50:47,185 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 11:50:47,186 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 11:50:47,374 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 11:50:47,379 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 11:50:47,379 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 11:50:47,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:47 BoogieIcfgContainer [2022-01-31 11:50:47,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 11:50:47,382 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 11:50:47,382 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 11:50:47,390 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 11:50:47,395 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:47" (1/1) ... [2022-01-31 11:50:47,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:50:47 BasicIcfg [2022-01-31 11:50:47,415 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 11:50:47,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 11:50:47,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 11:50:47,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 11:50:47,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:50:46" (1/4) ... [2022-01-31 11:50:47,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969e06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:50:47, skipping insertion in model container [2022-01-31 11:50:47,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:50:46" (2/4) ... [2022-01-31 11:50:47,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969e06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:50:47, skipping insertion in model container [2022-01-31 11:50:47,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:50:47" (3/4) ... [2022-01-31 11:50:47,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5969e06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 11:50:47, skipping insertion in model container [2022-01-31 11:50:47,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 11:50:47" (4/4) ... [2022-01-31 11:50:47,421 INFO L111 eAbstractionObserver]: Analyzing ICFG sina5.cJordan [2022-01-31 11:50:47,425 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 11:50:47,425 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 11:50:47,473 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 11:50:47,478 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 11:50:47,479 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 11:50:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 11:50:47,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:47,501 INFO L514 BasicCegarLoop]: 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] [2022-01-31 11:50:47,502 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1605646092, now seen corresponding path program 1 times [2022-01-31 11:50:47,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122855113] [2022-01-31 11:50:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:47,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:47,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122855113] [2022-01-31 11:50:47,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122855113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:50:47,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:50:47,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 11:50:47,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456200127] [2022-01-31 11:50:47,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:50:47,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 11:50:47,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 11:50:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:50:47,777 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:47,836 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-01-31 11:50:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 11:50:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-01-31 11:50:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:47,843 INFO L225 Difference]: With dead ends: 43 [2022-01-31 11:50:47,843 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 11:50:47,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 11:50:47,847 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:47,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 11:50:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 11:50:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-31 11:50:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-31 11:50:47,875 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 28 [2022-01-31 11:50:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:47,876 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-31 11:50:47,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-31 11:50:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 11:50:47,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:47,877 INFO L514 BasicCegarLoop]: 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] [2022-01-31 11:50:47,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 11:50:47,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1186567865, now seen corresponding path program 1 times [2022-01-31 11:50:47,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:47,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409168364] [2022-01-31 11:50:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:47,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:47,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:47,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409168364] [2022-01-31 11:50:47,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409168364] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 11:50:47,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 11:50:47,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 11:50:47,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406808544] [2022-01-31 11:50:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 11:50:47,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 11:50:47,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:47,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 11:50:47,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 11:50:47,978 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:50:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:48,078 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-01-31 11:50:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 11:50:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-01-31 11:50:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:48,081 INFO L225 Difference]: With dead ends: 52 [2022-01-31 11:50:48,081 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 11:50:48,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 11:50:48,083 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:48,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 11:50:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 11:50:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-01-31 11:50:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-01-31 11:50:48,091 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 28 [2022-01-31 11:50:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:48,091 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-01-31 11:50:48,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 11:50:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-01-31 11:50:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 11:50:48,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:48,093 INFO L514 BasicCegarLoop]: 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] [2022-01-31 11:50:48,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 11:50:48,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 147811565, now seen corresponding path program 1 times [2022-01-31 11:50:48,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:48,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142392323] [2022-01-31 11:50:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:48,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:49,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:49,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142392323] [2022-01-31 11:50:49,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142392323] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:49,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406090423] [2022-01-31 11:50:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:49,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:49,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:49,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:49,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 11:50:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:49,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-31 11:50:49,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:49,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-31 11:50:49,439 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:50:49,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 19 [2022-01-31 11:50:49,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:49,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-31 11:50:49,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-01-31 11:50:50,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2022-01-31 11:50:50,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-01-31 11:50:50,626 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:50:50,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 24 [2022-01-31 11:50:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:50,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:51,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:51,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:51,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:51,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406090423] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:51,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:51,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 45 [2022-01-31 11:50:51,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618318573] [2022-01-31 11:50:51,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:51,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-31 11:50:51,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:51,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-31 11:50:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1760, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 11:50:51,493 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 45 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:50:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:52,445 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-01-31 11:50:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-31 11:50:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-01-31 11:50:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:52,447 INFO L225 Difference]: With dead ends: 76 [2022-01-31 11:50:52,447 INFO L226 Difference]: Without dead ends: 76 [2022-01-31 11:50:52,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=2356, Unknown=0, NotChecked=0, Total=2652 [2022-01-31 11:50:52,449 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:52,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 704 Invalid, 0 Unknown, 20 Unchecked, 0.6s Time] [2022-01-31 11:50:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-31 11:50:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-01-31 11:50:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:50:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-31 11:50:52,457 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 38 [2022-01-31 11:50:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:52,457 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-31 11:50:52,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 42 states have internal predecessors, (79), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 11:50:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-31 11:50:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 11:50:52,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:52,459 INFO L514 BasicCegarLoop]: 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] [2022-01-31 11:50:52,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-31 11:50:52,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:52,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2045725077, now seen corresponding path program 2 times [2022-01-31 11:50:52,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:52,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403618843] [2022-01-31 11:50:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:52,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:52,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 11:50:52,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:52,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403618843] [2022-01-31 11:50:52,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403618843] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:52,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812901219] [2022-01-31 11:50:52,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 11:50:52,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:52,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:52,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 11:50:52,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 11:50:52,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:52,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 11:50:52,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 11:50:52,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:50:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 11:50:52,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812901219] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:50:52,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:50:52,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-01-31 11:50:52,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339241840] [2022-01-31 11:50:52,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:50:52,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:50:52,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:50:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:50:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:50:52,999 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:50:53,392 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-01-31 11:50:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 11:50:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-01-31 11:50:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:50:53,395 INFO L225 Difference]: With dead ends: 92 [2022-01-31 11:50:53,395 INFO L226 Difference]: Without dead ends: 66 [2022-01-31 11:50:53,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2022-01-31 11:50:53,396 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 135 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:50:53,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 106 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:50:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-31 11:50:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2022-01-31 11:50:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 11:50:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-01-31 11:50:53,406 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 40 [2022-01-31 11:50:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:50:53,406 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-01-31 11:50:53,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:50:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-01-31 11:50:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 11:50:53,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:50:53,408 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2022-01-31 11:50:53,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 11:50:53,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 11:50:53,615 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:50:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:50:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 201880609, now seen corresponding path program 3 times [2022-01-31 11:50:53,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:50:53,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067067116] [2022-01-31 11:50:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:50:53,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:50:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:50:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:50:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:50:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:50:55,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:50:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067067116] [2022-01-31 11:50:55,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067067116] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:50:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157396010] [2022-01-31 11:50:55,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 11:50:55,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:50:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:50:55,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:50:55,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 11:50:55,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 11:50:55,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:50:55,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 87 conjunts are in the unsatisfiable core [2022-01-31 11:50:55,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:50:55,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 12 [2022-01-31 11:50:55,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-31 11:50:55,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:55,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-31 11:50:55,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:55,918 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 11:50:55,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:50:56,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,254 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-31 11:50:56,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46 [2022-01-31 11:50:56,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,450 INFO L353 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-01-31 11:50:56,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 56 [2022-01-31 11:50:56,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:56,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:56,930 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-31 11:50:56,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 65 [2022-01-31 11:50:57,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,169 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-01-31 11:50:57,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 74 [2022-01-31 11:50:57,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:57,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:57,724 INFO L353 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-01-31 11:50:57,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 81 [2022-01-31 11:50:58,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:58,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:58,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-01-31 11:50:58,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:58,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 68 [2022-01-31 11:50:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:50:58,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:50:58,926 INFO L353 Elim1Store]: treesize reduction 128, result has 29.3 percent of original size [2022-01-31 11:50:58,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 90 [2022-01-31 11:51:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:51:00,464 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:51:00,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 26 [2022-01-31 11:51:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:51:00,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:54:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:54:10,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157396010] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:54:10,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:54:10,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 95 [2022-01-31 11:54:10,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085381294] [2022-01-31 11:54:10,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:54:10,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-01-31 11:54:10,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:54:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-01-31 11:54:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=8041, Unknown=86, NotChecked=0, Total=8930 [2022-01-31 11:54:10,528 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 95 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 92 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:54:43,512 WARN L228 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:56:51,611 WARN L228 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 11:57:31,313 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (forall ((v_main_~i~0_64 Int)) (or (forall ((v_ArrVal_211 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_64 8)) v_ArrVal_211) c_main_~a~0.offset) (+ (* c_~N~0 2) 1))) (not (<= v_main_~i~0_64 (+ c_main_~i~0 1))) (< (+ v_main_~i~0_64 1) c_~N~0))) (exists ((|main_~#sum~0.offset| Int) (main_~b~0.base Int) (|main_~#sum~0.base| Int) (v_main_~i~0_56 Int)) (let ((.cse1 (select |c_#memory_int| main_~b~0.base))) (let ((.cse2 (select .cse1 (* v_main_~i~0_56 8)))) (let ((.cse0 (+ 3 .cse2))) (and (= .cse0 4) (<= v_main_~i~0_56 1) (= (select .cse1 0) 1) (<= c_~N~0 (+ v_main_~i~0_56 1)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) .cse0) (not (= c_main_~a~0.base main_~b~0.base)) (or (= (* c_main_~i~0 8) 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (+ .cse2 4))) (not (= main_~b~0.base |main_~#sum~0.base|)) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|)))))) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) 0) (+ (* c_~N~0 2) 1)) (exists ((v_main_~i~0_54 Int)) (and (<= c_~N~0 (+ v_main_~i~0_54 1)) (<= v_main_~i~0_54 1) (let ((.cse3 (* v_main_~i~0_54 8))) (or (= (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset)) 1) (= .cse3 (* c_main_~i~0 8))))))) is different from false [2022-01-31 11:57:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:57:33,929 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-01-31 11:57:33,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-01-31 11:57:33,930 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 92 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-01-31 11:57:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:57:33,932 INFO L225 Difference]: With dead ends: 123 [2022-01-31 11:57:33,932 INFO L226 Difference]: Without dead ends: 123 [2022-01-31 11:57:33,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5379 ImplicationChecksByTransitivity, 393.0s TimeCoverageRelationStatistics Valid=1557, Invalid=15573, Unknown=166, NotChecked=260, Total=17556 [2022-01-31 11:57:33,938 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 773 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:57:33,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 357 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 457 Invalid, 0 Unknown, 773 Unchecked, 0.3s Time] [2022-01-31 11:57:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-31 11:57:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2022-01-31 11:57:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 106 states have (on average 1.169811320754717) internal successors, (124), 107 states have internal predecessors, (124), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:57:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2022-01-31 11:57:33,946 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 48 [2022-01-31 11:57:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:57:33,947 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2022-01-31 11:57:33,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 92 states have internal predecessors, (109), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-01-31 11:57:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 11:57:33,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:57:33,949 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2022-01-31 11:57:33,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 11:57:34,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:34,163 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:57:34,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:57:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash -581743297, now seen corresponding path program 4 times [2022-01-31 11:57:34,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:57:34,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835008437] [2022-01-31 11:57:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:57:34,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:57:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:34,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:57:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:57:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:57:34,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:57:34,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835008437] [2022-01-31 11:57:34,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835008437] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:57:34,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797170634] [2022-01-31 11:57:34,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 11:57:34,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:34,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:57:34,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:57:34,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 11:57:34,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 11:57:34,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:57:34,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:57:34,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:57:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:57:34,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:57:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 11:57:34,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797170634] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:57:34,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:57:34,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:57:34,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689092394] [2022-01-31 11:57:34,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:57:34,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:57:34,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:57:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:57:34,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:57:34,555 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:57:34,805 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2022-01-31 11:57:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 11:57:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-01-31 11:57:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:57:34,807 INFO L225 Difference]: With dead ends: 175 [2022-01-31 11:57:34,808 INFO L226 Difference]: Without dead ends: 172 [2022-01-31 11:57:34,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-01-31 11:57:34,809 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 11:57:34,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 86 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 11:57:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-01-31 11:57:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 133. [2022-01-31 11:57:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 120 states have (on average 1.125) internal successors, (135), 122 states have internal predecessors, (135), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:57:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2022-01-31 11:57:34,821 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 50 [2022-01-31 11:57:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:57:34,822 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2022-01-31 11:57:34,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-01-31 11:57:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 11:57:34,823 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:57:34,823 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-01-31 11:57:34,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 11:57:35,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:35,046 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:57:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:57:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash -159428389, now seen corresponding path program 5 times [2022-01-31 11:57:35,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:57:35,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358050108] [2022-01-31 11:57:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:57:35,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:57:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:57:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:57:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 11:57:35,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:57:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358050108] [2022-01-31 11:57:35,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358050108] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:57:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916413039] [2022-01-31 11:57:35,146 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 11:57:35,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:35,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:57:35,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:57:35,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 11:57:35,371 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 11:57:35,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:57:35,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 11:57:35,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:57:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 11:57:35,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:57:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-31 11:57:35,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916413039] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:57:35,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:57:35,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-01-31 11:57:35,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708002475] [2022-01-31 11:57:35,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:57:35,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 11:57:35,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:57:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 11:57:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-31 11:57:35,599 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:57:35,968 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-01-31 11:57:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 11:57:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-01-31 11:57:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:57:35,970 INFO L225 Difference]: With dead ends: 130 [2022-01-31 11:57:35,971 INFO L226 Difference]: Without dead ends: 128 [2022-01-31 11:57:35,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-01-31 11:57:35,973 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 11:57:35,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 112 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 11:57:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-31 11:57:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2022-01-31 11:57:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.0786516853932584) internal successors, (96), 89 states have internal predecessors, (96), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 11:57:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-01-31 11:57:35,990 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 52 [2022-01-31 11:57:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:57:35,990 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-01-31 11:57:35,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 11:57:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-01-31 11:57:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 11:57:35,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:57:35,993 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2022-01-31 11:57:36,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 11:57:36,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:36,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:57:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:57:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1572069590, now seen corresponding path program 1 times [2022-01-31 11:57:36,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:57:36,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014172609] [2022-01-31 11:57:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:57:36,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:57:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:57:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:57:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 11:57:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:57:37,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:57:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014172609] [2022-01-31 11:57:37,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014172609] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:57:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462751878] [2022-01-31 11:57:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:57:37,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:57:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:57:37,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:57:38,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 11:57:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:57:38,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-31 11:57:38,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:57:38,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 42 [2022-01-31 11:57:38,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-01-31 11:57:38,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-31 11:57:38,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-01-31 11:57:38,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-01-31 11:57:38,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-01-31 11:57:38,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-01-31 11:57:38,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-01-31 11:57:38,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-31 11:57:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:57:38,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-01-31 11:57:38,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:38,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-01-31 11:57:40,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:57:40,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-01-31 11:57:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-31 11:57:40,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 11:58:07,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:58:07,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 226 [2022-01-31 11:58:09,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse3 (+ c_main_~a~0.offset 8)) (.cse2 (let ((.cse5 (select .cse4 c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ (select .cse5 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse1 (+ (select .cse2 .cse3) (select (select (store .cse4 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) c_main_~a~0.offset))) (or (not (= (mod (+ .cse0 1) 2) 0)) (= .cse1 (+ (* (div (+ (* (- 1) .cse0) 1) (- 2)) 2) 1)))))))) is different from false [2022-01-31 11:58:09,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse3 (+ c_main_~a~0.offset 8)) (.cse2 (let ((.cse5 (select .cse4 c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ (select .cse5 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse0 (+ (select .cse2 .cse3) (select (select (store .cse4 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse1 (select (store .cse2 .cse3 .cse0) c_main_~a~0.offset))) (or (= .cse0 (+ (* (div (+ (* (- 1) .cse1) 1) (- 2)) 2) 1)) (not (= (mod (+ .cse1 1) 2) 0)))))))) is different from false [2022-01-31 11:58:11,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) 1)) c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ (select v_arrayElimArr_1 |main_~#sum~0.offset|) (select .cse5 c_main_~a~0.offset))))) (.cse3 (+ c_main_~a~0.offset 8))) (let ((.cse1 (+ (select (select (store .cse4 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse2 .cse3)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) c_main_~a~0.offset))) (or (= (+ (* 2 (div (+ (* (- 1) .cse0) 1) (- 2))) 1) .cse1) (not (= (mod (+ .cse0 1) 2) 0)))))))) is different from false [2022-01-31 11:58:13,764 WARN L838 $PredicateComparison]: unable to prove that (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) 1)) c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse2 (let ((.cse5 (select .cse4 c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ (select .cse5 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|))))) (.cse3 (+ c_main_~a~0.offset 8))) (let ((.cse1 (+ (select (select (store .cse4 c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |main_~#sum~0.offset|) (select .cse2 .cse3)))) (let ((.cse0 (select (store .cse2 .cse3 .cse1) c_main_~a~0.offset))) (or (not (= (mod (+ .cse0 1) 2) 0)) (= .cse1 (+ (* 2 (div (+ (* (- 1) .cse0) 1) (- 2))) 1)))))))) is different from false [2022-01-31 11:58:13,857 INFO L353 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-01-31 11:58:13,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 673 treesize of output 318 [2022-01-31 11:58:13,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1157 treesize of output 1101 [2022-01-31 11:58:13,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:13,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:14,296 INFO L353 Elim1Store]: treesize reduction 29, result has 74.8 percent of original size [2022-01-31 11:58:14,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 667 treesize of output 713 [2022-01-31 11:58:14,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:14,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:14,388 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:58:14,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 764 treesize of output 648 [2022-01-31 11:58:14,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:14,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:58:14,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 11:58:14,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 371 treesize of output 363 [2022-01-31 11:58:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 9 not checked. [2022-01-31 11:58:16,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462751878] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 11:58:16,885 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 11:58:16,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21, 22] total 71 [2022-01-31 11:58:16,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612994593] [2022-01-31 11:58:16,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 11:58:16,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-01-31 11:58:16,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 11:58:16,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-01-31 11:58:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=4129, Unknown=16, NotChecked=532, Total=4970 [2022-01-31 11:58:16,900 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 71 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 68 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:58:34,473 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_main_~i~0 8))) (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ c_main_~a~0.offset .cse7))) (let ((.cse5 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse6 (select .cse3 .cse4)) (.cse1 (+ c_main_~a~0.offset 8))) (and (<= c_~N~0 2) (let ((.cse0 (store .cse3 .cse4 (+ .cse5 .cse6)))) (let ((.cse2 (select .cse0 c_main_~a~0.offset))) (or (= (select .cse0 .cse1) (+ (* 2 (div (+ (* (- 1) .cse2) 1) (- 2))) 1)) (not (= (mod (+ .cse2 1) 2) 0))))) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= .cse5 (+ (- 1) .cse6)) (= .cse6 1) (= (select (select |c_#memory_int| c_main_~b~0.base) (+ .cse7 c_main_~b~0.offset)) 1) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse3 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse3 8) 1) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse11 (+ c_main_~a~0.offset 8)) (.cse10 (let ((.cse13 (select .cse12 c_main_~a~0.base))) (store .cse13 c_main_~a~0.offset (+ (select .cse13 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse9 (+ (select .cse10 .cse11) (select (select (store .cse12 c_main_~a~0.base .cse10) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse8 (select (store .cse10 .cse11 .cse9) c_main_~a~0.offset))) (or (not (= (mod (+ .cse8 1) 2) 0)) (= .cse9 (+ (* (div (+ (* (- 1) .cse8) 1) (- 2)) 2) 1)))))))) (= .cse5 0) (let ((.cse14 (select .cse3 0))) (or (not (= .cse14 (+ (* c_~N~0 2) 1))) (and (<= c_main_~i~0 1) (<= 1 c_main_~i~0) (= .cse14 .cse6)))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse18 (+ c_main_~a~0.offset 8)) (.cse17 (let ((.cse20 (select .cse19 c_main_~a~0.base))) (store .cse20 c_main_~a~0.offset (+ (select .cse20 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse15 (+ (select .cse17 .cse18) (select (select (store .cse19 c_main_~a~0.base .cse17) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse16 (select (store .cse17 .cse18 .cse15) c_main_~a~0.offset))) (or (= .cse15 (+ (* (div (+ (* (- 1) .cse16) 1) (- 2)) 2) 1)) (not (= (mod (+ .cse16 1) 2) 0)))))))) (= (select .cse3 .cse1) 1) (not (= c_main_~b~0.base c_main_~a~0.base)))))) is different from false [2022-01-31 11:58:36,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (not (= c_main_~b~0.base c_main_~a~0.base)))) (and (or (and (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 8) 1) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) .cse1 (= (select (select |c_#memory_int| c_main_~b~0.base) 0) 1)) (not (= 8 (+ (* c_main_~i~0 8) c_main_~b~0.offset)))) (<= c_main_~i~0 1) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (+ c_main_~a~0.offset 8)) (.cse4 (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ (select .cse7 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse3 (+ (select .cse4 .cse5) (select (select (store .cse6 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse2 (select (store .cse4 .cse5 .cse3) c_main_~a~0.offset))) (or (not (= (mod (+ .cse2 1) 2) 0)) (= .cse3 (+ (* (div (+ (* (- 1) .cse2) 1) (- 2)) 2) 1)))))))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse11 (+ c_main_~a~0.offset 8)) (.cse10 (let ((.cse13 (select .cse12 c_main_~a~0.base))) (store .cse13 c_main_~a~0.offset (+ (select .cse13 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse8 (+ (select .cse10 .cse11) (select (select (store .cse12 c_main_~a~0.base .cse10) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse9 (select (store .cse10 .cse11 .cse8) c_main_~a~0.offset))) (or (= .cse8 (+ (* (div (+ (* (- 1) .cse9) 1) (- 2)) 2) 1)) (not (= (mod (+ .cse9 1) 2) 0)))))))) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) .cse1)) is different from false [2022-01-31 11:58:41,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base)) (.cse3 (not (= c_main_~b~0.base c_main_~a~0.base)))) (and (<= c_main_~i~0 1) (let ((.cse1 (+ (* c_main_~i~0 8) c_main_~b~0.offset))) (or (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= (select .cse0 .cse1) 1) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse2 8) 1) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) .cse3 (= (select .cse0 0) 1))) (not (= 8 .cse1)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select .cse2 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse7 (+ c_main_~a~0.offset 8)) (.cse6 (let ((.cse9 (select .cse8 c_main_~a~0.base))) (store .cse9 c_main_~a~0.offset (+ (select .cse9 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse5 (+ (select .cse6 .cse7) (select (select (store .cse8 c_main_~a~0.base .cse6) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse4 (select (store .cse6 .cse7 .cse5) c_main_~a~0.offset))) (or (not (= (mod (+ .cse4 1) 2) 0)) (= .cse5 (+ (* (div (+ (* (- 1) .cse4) 1) (- 2)) 2) 1)))))))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse13 (+ c_main_~a~0.offset 8)) (.cse12 (let ((.cse15 (select .cse14 c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ (select .cse15 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse10 (+ (select .cse12 .cse13) (select (select (store .cse14 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse11 (select (store .cse12 .cse13 .cse10) c_main_~a~0.offset))) (or (= .cse10 (+ (* (div (+ (* (- 1) .cse11) 1) (- 2)) 2) 1)) (not (= (mod (+ .cse11 1) 2) 0)))))))) (= (select .cse2 (+ c_main_~a~0.offset 8)) 1) .cse3)) is different from false [2022-01-31 11:58:43,731 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (not (= c_main_~b~0.base c_main_~a~0.base)))) (and (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse3 (let ((.cse6 (select .cse5 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ (select .cse6 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse2 (+ (select .cse3 .cse4) (select (select (store .cse5 c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) c_main_~a~0.offset))) (or (not (= (mod (+ .cse1 1) 2) 0)) (= .cse2 (+ (* (div (+ (* (- 1) .cse1) 1) (- 2)) 2) 1)))))))) (or (let ((.cse7 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse7 8) 1) (= (select .cse0 8) 1) (<= 2 c_~N~0) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) .cse8 (= (select .cse7 0) 1))) (<= (+ (* c_main_~i~0 8) c_main_~b~0.offset 1) (* c_~N~0 8))) (forall ((|main_~#sum~0.offset| Int) (v_ArrVal_418 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| c_main_~b~0.base v_ArrVal_418) |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse12 (+ c_main_~a~0.offset 8)) (.cse11 (let ((.cse14 (select .cse13 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ (select .cse14 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse9 (+ (select .cse11 .cse12) (select (select (store .cse13 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse10 (select (store .cse11 .cse12 .cse9) c_main_~a~0.offset))) (or (= .cse9 (+ (* (div (+ (* (- 1) .cse10) 1) (- 2)) 2) 1)) (not (= (mod (+ .cse10 1) 2) 0)))))))) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) .cse8)) is different from false [2022-01-31 11:58:48,652 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse1 8) 1) (= (select .cse0 8) 1) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (+ c_main_~a~0.offset 8)) (.cse4 (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ (select .cse7 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse3 (+ (select .cse4 .cse5) (select (select (store .cse6 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse2 (select (store .cse4 .cse5 .cse3) c_main_~a~0.offset))) (or (not (= (mod (+ .cse2 1) 2) 0)) (= .cse3 (+ (* (div (+ (* (- 1) .cse2) 1) (- 2)) 2) 1)))))))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse1 0) 1))) is different from false [2022-01-31 11:58:50,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse1 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_~N~0 2) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse1 8) 1) (= (select .cse0 8) 1) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (+ c_main_~a~0.offset 8)) (.cse4 (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ (select .cse7 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse3 (+ (select .cse4 .cse5) (select (select (store .cse6 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse2 (select (store .cse4 .cse5 .cse3) c_main_~a~0.offset))) (or (not (= (mod (+ .cse2 1) 2) 0)) (= .cse3 (+ (* (div (+ (* (- 1) .cse2) 1) (- 2)) 2) 1)))))))) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 0) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse1 0) 1))) is different from false [2022-01-31 11:58:55,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse1 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 4)) (.cse0 (+ (* c_~N~0 2) (select .cse2 (+ c_main_~a~0.offset (* c_main_~i~0 8))))) (.cse3 (select |c_#memory_int| c_main_~b~0.base))) (and (<= .cse0 .cse1) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= c_main_~i~0 0) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse2 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse3 8) 1) (= (select .cse2 8) 1) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse7 (+ c_main_~a~0.offset 8)) (.cse6 (let ((.cse9 (select .cse8 c_main_~a~0.base))) (store .cse9 c_main_~a~0.offset (+ (select .cse9 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse5 (+ (select .cse6 .cse7) (select (select (store .cse8 c_main_~a~0.base .cse6) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse4 (select (store .cse6 .cse7 .cse5) c_main_~a~0.offset))) (or (not (= (mod (+ .cse4 1) 2) 0)) (= .cse5 (+ (* (div (+ (* (- 1) .cse4) 1) (- 2)) 2) 1)))))))) (<= .cse1 .cse0) (= (select .cse2 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse3 0) 1)))) is different from false [2022-01-31 11:58:57,916 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8))) (.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_main_~i~0 1) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (or (let ((.cse3 (+ (select .cse0 0) (* c_~N~0 2))) (.cse2 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 4))) (and (= (select .cse0 .cse1) 1) (<= .cse2 .cse3) (= (select .cse4 8) 1) (<= .cse3 .cse2) (not (= c_main_~b~0.base c_main_~a~0.base)))) (not (= 8 .cse1))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (or (not (<= .cse1 7)) (<= 2 c_~N~0)) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse8 (+ c_main_~a~0.offset 8)) (.cse7 (let ((.cse10 (select .cse9 c_main_~a~0.base))) (store .cse10 c_main_~a~0.offset (+ (select .cse10 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse6 (+ (select .cse7 .cse8) (select (select (store .cse9 c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse5 (select (store .cse7 .cse8 .cse6) c_main_~a~0.offset))) (or (not (= (mod (+ .cse5 1) 2) 0)) (= .cse6 (+ (* (div (+ (* (- 1) .cse5) 1) (- 2)) 2) 1)))))))) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) (= (select .cse4 0) 1))) is different from false [2022-01-31 11:59:00,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~a~0.offset (* c_main_~i~0 8))) (.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse8 (select |c_#memory_int| c_main_~b~0.base))) (and (<= c_main_~i~0 1) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (or (not (<= .cse1 7)) (<= 2 c_~N~0)) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse5 (+ c_main_~a~0.offset 8)) (.cse4 (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ (select .cse7 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse3 (+ (select .cse4 .cse5) (select (select (store .cse6 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse2 (select (store .cse4 .cse5 .cse3) c_main_~a~0.offset))) (or (not (= (mod (+ .cse2 1) 2) 0)) (= .cse3 (+ (* (div (+ (* (- 1) .cse2) 1) (- 2)) 2) 1)))))))) (or (not (= 8 .cse1)) (let ((.cse10 (+ (* (select .cse0 .cse1) 2) (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)) (.cse9 (+ (select .cse0 0) (* c_~N~0 2)))) (and (= (select .cse8 8) 1) (<= .cse9 .cse10) (<= .cse10 .cse9) (not (= c_main_~b~0.base c_main_~a~0.base))))) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) (= (select .cse8 0) 1))) is different from false [2022-01-31 11:59:02,233 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (select |c_#memory_int| c_main_~b~0.base))) (and (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse0 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse4 (+ c_main_~a~0.offset 8)) (.cse3 (let ((.cse6 (select .cse5 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ (select .cse6 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse2 (+ (select .cse3 .cse4) (select (select (store .cse5 c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse1 (select (store .cse3 .cse4 .cse2) c_main_~a~0.offset))) (or (not (= (mod (+ .cse1 1) 2) 0)) (= .cse2 (+ (* (div (+ (* (- 1) .cse1) 1) (- 2)) 2) 1)))))))) (or (<= (+ c_main_~a~0.offset (* c_main_~i~0 8) 1) (* c_~N~0 8)) (let ((.cse8 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* 2 (select .cse0 8)) 1)) (.cse7 (+ (select .cse0 0) (* c_~N~0 2)))) (and (<= .cse7 .cse8) (= (select .cse9 8) 1) (<= .cse8 .cse7) (not (= c_main_~b~0.base c_main_~a~0.base))))) (= (select .cse0 (+ c_main_~a~0.offset 8)) 1) (= (select .cse9 0) 1))) is different from false [2022-01-31 11:59:04,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse1 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* 2 (select .cse2 8)) 1)) (.cse0 (+ (select .cse2 0) (* c_~N~0 2))) (.cse3 (select |c_#memory_int| c_main_~b~0.base))) (and (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (<= .cse0 .cse1) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse2 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse3 8) 1) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse7 (+ c_main_~a~0.offset 8)) (.cse6 (let ((.cse9 (select .cse8 c_main_~a~0.base))) (store .cse9 c_main_~a~0.offset (+ (select .cse9 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse5 (+ (select .cse6 .cse7) (select (select (store .cse8 c_main_~a~0.base .cse6) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse4 (select (store .cse6 .cse7 .cse5) c_main_~a~0.offset))) (or (not (= (mod (+ .cse4 1) 2) 0)) (= .cse5 (+ (* (div (+ (* (- 1) .cse4) 1) (- 2)) 2) 1)))))))) (<= .cse1 .cse0) (= (select .cse2 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base)) (= (select .cse3 0) 1)))) is different from false [2022-01-31 11:59:06,603 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select |c_#memory_int| c_main_~b~0.base)) (.cse2 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (* 2 (select .cse3 8)) 1)) (.cse1 (+ (select .cse3 0) (* c_~N~0 2)))) (and (= (+ (- 1) (select .cse0 (+ (* c_main_~i~0 8) c_main_~b~0.offset))) 0) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (= c_main_~i~0 0) (<= .cse1 .cse2) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= (select .cse3 c_main_~a~0.offset) 1) (= c_main_~a~0.offset 0) (= (select .cse0 8) 1) (= c_main_~b~0.offset 0) (forall ((|main_~#sum~0.offset| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_main_~#sum~0.base| v_arrayElimArr_1))) (let ((.cse7 (+ c_main_~a~0.offset 8)) (.cse6 (let ((.cse9 (select .cse8 c_main_~a~0.base))) (store .cse9 c_main_~a~0.offset (+ (select .cse9 c_main_~a~0.offset) (select v_arrayElimArr_1 |main_~#sum~0.offset|)))))) (let ((.cse5 (+ (select .cse6 .cse7) (select (select (store .cse8 c_main_~a~0.base .cse6) |c_main_~#sum~0.base|) |main_~#sum~0.offset|)))) (let ((.cse4 (select (store .cse6 .cse7 .cse5) c_main_~a~0.offset))) (or (not (= (mod (+ .cse4 1) 2) 0)) (= .cse5 (+ (* (div (+ (* (- 1) .cse4) 1) (- 2)) 2) 1)))))))) (<= .cse2 .cse1) (= (select .cse3 (+ c_main_~a~0.offset 8)) 1) (not (= c_main_~b~0.base c_main_~a~0.base))))) is different from false [2022-01-31 11:59:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 11:59:22,484 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-01-31 11:59:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-01-31 11:59:22,485 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 68 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 56 [2022-01-31 11:59:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 11:59:22,485 INFO L225 Difference]: With dead ends: 121 [2022-01-31 11:59:22,486 INFO L226 Difference]: Without dead ends: 84 [2022-01-31 11:59:22,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 95.1s TimeCoverageRelationStatistics Valid=746, Invalid=8592, Unknown=38, NotChecked=3280, Total=12656 [2022-01-31 11:59:22,488 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 83 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-01-31 11:59:22,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 483 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1502 Invalid, 0 Unknown, 489 Unchecked, 6.0s Time] [2022-01-31 11:59:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-31 11:59:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2022-01-31 11:59:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 11:59:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-01-31 11:59:22,493 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 56 [2022-01-31 11:59:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 11:59:22,493 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-01-31 11:59:22,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 68 states have internal predecessors, (122), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 11:59:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-01-31 11:59:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 11:59:22,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 11:59:22,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 11:59:22,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 11:59:22,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:59:22,697 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 11:59:22,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 11:59:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2035454891, now seen corresponding path program 6 times [2022-01-31 11:59:22,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 11:59:22,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254922766] [2022-01-31 11:59:22,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 11:59:22,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 11:59:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 11:59:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 11:59:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 11:59:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:59:34,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 11:59:34,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254922766] [2022-01-31 11:59:34,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254922766] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 11:59:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51283759] [2022-01-31 11:59:34,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 11:59:34,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 11:59:34,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 11:59:34,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 11:59:34,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 11:59:34,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 11:59:34,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 11:59:34,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2022-01-31 11:59:34,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 11:59:34,492 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 11:59:34,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 19 [2022-01-31 11:59:34,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-01-31 11:59:34,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-31 11:59:34,955 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-31 11:59:34,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-31 11:59:35,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:35,824 INFO L353 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2022-01-31 11:59:35,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2022-01-31 11:59:37,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:37,465 INFO L353 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-01-31 11:59:37,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 61 [2022-01-31 11:59:38,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:38,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:38,334 INFO L353 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-01-31 11:59:38,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 76 [2022-01-31 11:59:39,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:39,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 91 [2022-01-31 11:59:41,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2022-01-31 11:59:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:41,924 INFO L353 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2022-01-31 11:59:41,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 101 [2022-01-31 11:59:42,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:42,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:43,036 INFO L353 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-01-31 11:59:43,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 117 [2022-01-31 11:59:45,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:45,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:45,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:45,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:45,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 93 [2022-01-31 11:59:46,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:46,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:46,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 108 [2022-01-31 11:59:47,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:47,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:47,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 104 [2022-01-31 11:59:48,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:48,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:48,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:48,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 86 [2022-01-31 11:59:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:49,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:49,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:49,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:49,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:49,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 11:59:50,170 INFO L353 Elim1Store]: treesize reduction 191, result has 29.5 percent of original size [2022-01-31 11:59:50,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 127 [2022-01-31 11:59:51,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:51,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:51,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 11:59:51,875 INFO L353 Elim1Store]: treesize reduction 75, result has 42.3 percent of original size [2022-01-31 11:59:51,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 141 [2022-01-31 11:59:54,699 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-31 11:59:54,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2022-01-31 11:59:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 11:59:55,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:00:00,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (not (< (+ main_~i~0 1) c_~N~0)) (forall ((v_ArrVal_543 Int) (v_ArrVal_542 Int)) (= (+ (* c_~N~0 2) 1) (select (let ((.cse0 (* main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse0) v_ArrVal_542) (+ c_main_~a~0.offset .cse0 8) v_ArrVal_543)) c_main_~a~0.offset))) (< (+ main_~i~0 2) c_~N~0))) is different from false [2022-01-31 12:01:45,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_542 Int) (v_main_~i~0_153 Int) (v_main_~i~0_162 Int)) (or (not (< (+ v_main_~i~0_162 1) c_~N~0)) (< (+ 2 v_main_~i~0_153) c_~N~0) (not (< (+ v_main_~i~0_153 1) c_~N~0)) (< (+ 2 v_main_~i~0_162) c_~N~0) (= (+ (* c_~N~0 2) 1) (select (let ((.cse10 (* 8 v_main_~i~0_153))) (store (store (let ((.cse8 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse8 |c_main_~#sum~0.offset|)) (.cse5 (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)))) (.cse9 (* 8 v_main_~i~0_162))) (let ((.cse1 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse9)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8 .cse9)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse5 .cse7))) c_main_~b~0.base) c_main_~b~0.offset))) (let ((.cse4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse5 .cse7))) c_main_~b~0.base) (+ 8 c_main_~b~0.offset)))) (let ((.cse6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse7))) c_main_~b~0.base) (+ 16 c_main_~b~0.offset)))) (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ .cse1 .cse2 .cse3 .cse4 (select .cse0 c_main_~a~0.offset) .cse5 .cse6 .cse7)))))))))) (+ c_main_~a~0.offset .cse10) v_ArrVal_542) (+ c_main_~a~0.offset 8 .cse10) v_ArrVal_543)) c_main_~a~0.offset)))) is different from false [2022-01-31 12:01:47,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_542 Int) (v_main_~i~0_153 Int) (v_main_~i~0_162 Int)) (or (not (< (+ v_main_~i~0_162 1) c_~N~0)) (< (+ 2 v_main_~i~0_153) c_~N~0) (not (< (+ v_main_~i~0_153 1) c_~N~0)) (< (+ 2 v_main_~i~0_162) c_~N~0) (= (select (let ((.cse10 (* 8 v_main_~i~0_153))) (store (store (let ((.cse8 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse1 (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset)) (.cse5 (select .cse8 |c_main_~#sum~0.offset|)) (.cse9 (* 8 v_main_~i~0_162))) (let ((.cse4 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse9)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse4 .cse5))) c_main_~a~0.base) (+ c_main_~a~0.offset 8 .cse9)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4 .cse5))) c_main_~b~0.base) c_main_~b~0.offset))) (let ((.cse6 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4 .cse5 .cse7))) c_main_~b~0.base) (+ 8 c_main_~b~0.offset)))) (let ((.cse3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse4 .cse5 .cse6 .cse7))) c_main_~b~0.base) (+ 16 c_main_~b~0.offset)))) (let ((.cse0 (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (select .cse0 c_main_~a~0.offset) .cse7)))))))))) (+ c_main_~a~0.offset .cse10) v_ArrVal_542) (+ c_main_~a~0.offset 8 .cse10) v_ArrVal_543)) c_main_~a~0.offset) (+ (* c_~N~0 2) 1)))) is different from false [2022-01-31 12:03:01,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (v_ArrVal_542 Int) (main_~i~0 Int) (v_main_~i~0_153 Int) (v_main_~i~0_162 Int) (~N~0 Int)) (or (not (< (+ main_~i~0 1) ~N~0)) (not (< 2 ~N~0)) (not (< (+ v_main_~i~0_153 1) ~N~0)) (< (+ 2 v_main_~i~0_153) ~N~0) (< (+ main_~i~0 2) ~N~0) (= (+ (* 2 ~N~0) 1) (select (let ((.cse15 (* 8 v_main_~i~0_153))) (store (store (let ((.cse11 (+ 8 c_main_~b~0.offset)) (.cse10 (+ 16 c_main_~b~0.offset))) (let ((.cse8 (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base (let ((.cse14 (* main_~i~0 8))) (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse14) 1) (+ c_main_~a~0.offset .cse14 8) 1))))) (store .cse13 c_main_~b~0.base (store (store (store (select .cse13 c_main_~b~0.base) c_main_~b~0.offset 1) .cse11 1) .cse10 1))))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse3 (select (select .cse8 c_main_~a~0.base) c_main_~a~0.offset)) (.cse7 (select .cse9 |c_main_~#sum~0.offset|)) (.cse12 (* 8 v_main_~i~0_162))) (let ((.cse6 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse7))) c_main_~a~0.base) (+ c_main_~a~0.offset .cse12)))) (let ((.cse1 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse3 .cse6 .cse7))) c_main_~a~0.base) (+ c_main_~a~0.offset 8 .cse12)))) (let ((.cse2 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse3 .cse6 .cse7))) c_main_~b~0.base) c_main_~b~0.offset))) (let ((.cse4 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse6 .cse7))) c_main_~b~0.base) .cse11))) (let ((.cse5 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse6 .cse7))) c_main_~b~0.base) .cse10))) (let ((.cse0 (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) c_main_~a~0.base))) (store .cse0 c_main_~a~0.offset (+ .cse1 .cse2 .cse3 (select .cse0 c_main_~a~0.offset) .cse4 .cse5 .cse6 .cse7)))))))))))) (+ c_main_~a~0.offset .cse15) v_ArrVal_542) (+ c_main_~a~0.offset 8 .cse15) v_ArrVal_543)) c_main_~a~0.offset)) (not (< (+ v_main_~i~0_162 1) ~N~0)) (< 3 ~N~0) (< (+ 2 v_main_~i~0_162) ~N~0))) is different from false