/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-18 22:14:44,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 22:14:44,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 22:14:44,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 22:14:44,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 22:14:44,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 22:14:44,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 22:14:44,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 22:14:44,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 22:14:44,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 22:14:44,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 22:14:44,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 22:14:44,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 22:14:44,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 22:14:44,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 22:14:44,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 22:14:44,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 22:14:44,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 22:14:44,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 22:14:44,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 22:14:44,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 22:14:44,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 22:14:44,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 22:14:44,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 22:14:44,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 22:14:44,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 22:14:44,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 22:14:44,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 22:14:44,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 22:14:44,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 22:14:44,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 22:14:44,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 22:14:44,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 22:14:44,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 22:14:44,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 22:14:44,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 22:14:44,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 22:14:44,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 22:14:44,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 22:14:44,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 22:14:44,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 22:14:44,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 22:14:44,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-03-18 22:14:45,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 22:14:45,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 22:14:45,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-18 22:14:45,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-18 22:14:45,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-18 22:14:45,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-18 22:14:45,021 INFO L138 SettingsManager]: * Use SBE=true [2022-03-18 22:14:45,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 22:14:45,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 22:14:45,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 22:14:45,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 22:14:45,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 22:14:45,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 22:14:45,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 22:14:45,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 22:14:45,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-18 22:14:45,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-18 22:14:45,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-18 22:14:45,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-18 22:14:45,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 22:14:45,025 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-03-18 22:14:45,025 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-03-18 22:14:45,025 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-18 22:14:45,026 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-03-18 22:14:45,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 22:14:45,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 22:14:45,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 22:14:45,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 22:14:45,290 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 22:14:45,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-03-18 22:14:45,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fc24b19/0c8139556ba744ff915a6efca91228e5/FLAGeec99095f [2022-03-18 22:14:45,718 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 22:14:45,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2022-03-18 22:14:45,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fc24b19/0c8139556ba744ff915a6efca91228e5/FLAGeec99095f [2022-03-18 22:14:45,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fc24b19/0c8139556ba744ff915a6efca91228e5 [2022-03-18 22:14:45,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 22:14:45,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-18 22:14:45,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 22:14:45,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 22:14:45,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 22:14:45,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:45,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18021d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45, skipping insertion in model container [2022-03-18 22:14:45,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:45,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 22:14:45,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 22:14:45,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-03-18 22:14:45,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 22:14:45,949 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 22:14:45,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c[311,324] [2022-03-18 22:14:45,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 22:14:45,997 INFO L208 MainTranslator]: Completed translation [2022-03-18 22:14:45,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45 WrapperNode [2022-03-18 22:14:45,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 22:14:46,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 22:14:46,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 22:14:46,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 22:14:46,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 22:14:46,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 22:14:46,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 22:14:46,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 22:14:46,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (1/1) ... [2022-03-18 22:14:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 22:14:46,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:46,060 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-03-18 22:14:46,083 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-03-18 22:14:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 22:14:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 22:14:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 22:14:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-18 22:14:46,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 22:14:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 22:14:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 22:14:46,097 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 22:14:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 22:14:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-18 22:14:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 22:14:46,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 22:14:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 22:14:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 22:14:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 22:14:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 22:14:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 22:14:46,156 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 22:14:46,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 22:14:46,284 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 22:14:46,289 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 22:14:46,289 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 22:14:46,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:14:46 BoogieIcfgContainer [2022-03-18 22:14:46,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 22:14:46,291 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-18 22:14:46,292 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-18 22:14:46,292 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-18 22:14:46,295 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:14:46" (1/1) ... [2022-03-18 22:14:46,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 10:14:46 BasicIcfg [2022-03-18 22:14:46,307 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-18 22:14:46,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 22:14:46,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 22:14:46,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 22:14:46,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 10:14:45" (1/4) ... [2022-03-18 22:14:46,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8de870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 10:14:46, skipping insertion in model container [2022-03-18 22:14:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 10:14:45" (2/4) ... [2022-03-18 22:14:46,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8de870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 10:14:46, skipping insertion in model container [2022-03-18 22:14:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 10:14:46" (3/4) ... [2022-03-18 22:14:46,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8de870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 10:14:46, skipping insertion in model container [2022-03-18 22:14:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 18.03 10:14:46" (4/4) ... [2022-03-18 22:14:46,313 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.cqvasr [2022-03-18 22:14:46,317 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-18 22:14:46,317 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 22:14:46,375 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 22:14:46,380 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-03-18 22:14:46,380 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 22:14:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-18 22:14:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 22:14:46,416 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:46,417 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:46,417 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash -154368955, now seen corresponding path program 1 times [2022-03-18 22:14:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686865861] [2022-03-18 22:14:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:46,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686865861] [2022-03-18 22:14:46,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686865861] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:14:46,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:14:46,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-18 22:14:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078882794] [2022-03-18 22:14:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:14:46,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-18 22:14:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:46,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-18 22:14:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-18 22:14:46,636 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:46,677 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-03-18 22:14:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-18 22:14:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-18 22:14:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:46,687 INFO L225 Difference]: With dead ends: 31 [2022-03-18 22:14:46,687 INFO L226 Difference]: Without dead ends: 14 [2022-03-18 22:14:46,690 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-18 22:14:46,696 INFO L912 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:46,697 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 22:14:46,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-03-18 22:14:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-03-18 22:14:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-03-18 22:14:46,729 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-03-18 22:14:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:46,730 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-03-18 22:14:46,730 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-03-18 22:14:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-18 22:14:46,732 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:46,732 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:46,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 22:14:46,732 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -153445434, now seen corresponding path program 1 times [2022-03-18 22:14:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:46,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852844522] [2022-03-18 22:14:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:46,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852844522] [2022-03-18 22:14:46,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852844522] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 22:14:46,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 22:14:46,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 22:14:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722847869] [2022-03-18 22:14:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 22:14:46,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 22:14:46,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 22:14:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 22:14:46,847 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:46,891 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-03-18 22:14:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 22:14:46,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-18 22:14:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:46,892 INFO L225 Difference]: With dead ends: 25 [2022-03-18 22:14:46,892 INFO L226 Difference]: Without dead ends: 17 [2022-03-18 22:14:46,896 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-18 22:14:46,898 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:46,900 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 22:14:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-18 22:14:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-03-18 22:14:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-03-18 22:14:46,910 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-03-18 22:14:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:46,913 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-03-18 22:14:46,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-03-18 22:14:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-18 22:14:46,916 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:46,916 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:46,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 22:14:46,916 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1203653974, now seen corresponding path program 1 times [2022-03-18 22:14:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936727042] [2022-03-18 22:14:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936727042] [2022-03-18 22:14:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936727042] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:14:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164976021] [2022-03-18 22:14:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:14:47,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:47,017 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-03-18 22:14:47,026 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-03-18 22:14:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-18 22:14:47,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:14:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:47,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:14:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:47,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164976021] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:14:47,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:14:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 14 [2022-03-18 22:14:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403812689] [2022-03-18 22:14:47,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:14:47,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 22:14:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 22:14:47,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-18 22:14:47,322 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:47,604 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-03-18 22:14:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-18 22:14:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-03-18 22:14:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:47,605 INFO L225 Difference]: With dead ends: 37 [2022-03-18 22:14:47,605 INFO L226 Difference]: Without dead ends: 25 [2022-03-18 22:14:47,606 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-03-18 22:14:47,607 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:47,608 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 36 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 22:14:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-18 22:14:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-03-18 22:14:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-03-18 22:14:47,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-03-18 22:14:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:47,621 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-03-18 22:14:47,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-03-18 22:14:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 22:14:47,621 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:47,622 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:47,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-18 22:14:47,823 WARN L460 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-03-18 22:14:47,824 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:47,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2025124503, now seen corresponding path program 1 times [2022-03-18 22:14:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:47,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557301852] [2022-03-18 22:14:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-18 22:14:47,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:47,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557301852] [2022-03-18 22:14:47,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557301852] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:14:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366683145] [2022-03-18 22:14:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:47,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:14:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:47,932 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-03-18 22:14:47,933 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-03-18 22:14:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-18 22:14:47,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:14:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 22:14:48,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:14:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 22:14:48,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366683145] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:14:48,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:14:48,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-03-18 22:14:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673759356] [2022-03-18 22:14:48,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:14:48,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-18 22:14:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-18 22:14:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-18 22:14:48,148 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:48,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:48,530 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-03-18 22:14:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-18 22:14:48,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-18 22:14:48,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:48,532 INFO L225 Difference]: With dead ends: 59 [2022-03-18 22:14:48,533 INFO L226 Difference]: Without dead ends: 45 [2022-03-18 22:14:48,533 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-03-18 22:14:48,534 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:48,534 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 22:14:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-18 22:14:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-03-18 22:14:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-03-18 22:14:48,543 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 20 [2022-03-18 22:14:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:48,543 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-03-18 22:14:48,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-03-18 22:14:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-18 22:14:48,544 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:48,544 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:48,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-18 22:14:48,759 WARN L460 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-03-18 22:14:48,760 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1905741238, now seen corresponding path program 2 times [2022-03-18 22:14:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:48,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584109739] [2022-03-18 22:14:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-18 22:14:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:48,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584109739] [2022-03-18 22:14:48,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584109739] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:14:48,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980053744] [2022-03-18 22:14:48,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-18 22:14:48,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:14:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:48,886 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-03-18 22:14:48,887 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-03-18 22:14:48,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-18 22:14:48,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:14:48,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-18 22:14:48,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:14:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 22:14:49,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:14:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-18 22:14:49,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980053744] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:14:49,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:14:49,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-03-18 22:14:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304669921] [2022-03-18 22:14:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:14:49,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-18 22:14:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:49,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-18 22:14:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-03-18 22:14:49,164 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:49,721 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2022-03-18 22:14:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-18 22:14:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-03-18 22:14:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:49,722 INFO L225 Difference]: With dead ends: 110 [2022-03-18 22:14:49,723 INFO L226 Difference]: Without dead ends: 80 [2022-03-18 22:14:49,723 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-03-18 22:14:49,724 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:49,724 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 54 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 22:14:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-03-18 22:14:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-03-18 22:14:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-03-18 22:14:49,735 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-03-18 22:14:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:49,735 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-03-18 22:14:49,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 15 states have internal predecessors, (52), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-03-18 22:14:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-18 22:14:49,736 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:49,736 INFO L500 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:49,761 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-03-18 22:14:49,951 WARN L460 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-03-18 22:14:49,951 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 81509943, now seen corresponding path program 3 times [2022-03-18 22:14:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701725290] [2022-03-18 22:14:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 22:14:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:50,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701725290] [2022-03-18 22:14:50,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701725290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:14:50,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549785996] [2022-03-18 22:14:50,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-18 22:14:50,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:14:50,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:50,080 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-03-18 22:14:50,107 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-03-18 22:14:50,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-18 22:14:50,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:14:50,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-18 22:14:50,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:14:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-18 22:14:50,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:14:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-18 22:14:50,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549785996] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:14:50,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:14:50,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-03-18 22:14:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478230293] [2022-03-18 22:14:50,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:14:50,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-18 22:14:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:50,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-18 22:14:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2022-03-18 22:14:50,454 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:14:52,108 INFO L93 Difference]: Finished difference Result 148 states and 200 transitions. [2022-03-18 22:14:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-18 22:14:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-03-18 22:14:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:14:52,111 INFO L225 Difference]: With dead ends: 148 [2022-03-18 22:14:52,111 INFO L226 Difference]: Without dead ends: 109 [2022-03-18 22:14:52,112 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=1083, Unknown=0, NotChecked=0, Total=1560 [2022-03-18 22:14:52,112 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 141 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-18 22:14:52,113 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 43 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-18 22:14:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-18 22:14:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2022-03-18 22:14:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-03-18 22:14:52,126 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 32 [2022-03-18 22:14:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:14:52,126 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-03-18 22:14:52,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:14:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-03-18 22:14:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-03-18 22:14:52,128 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:14:52,128 INFO L500 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:14:52,135 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-03-18 22:14:52,335 WARN L460 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-03-18 22:14:52,336 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:14:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:14:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash -912098025, now seen corresponding path program 4 times [2022-03-18 22:14:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:14:52,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931778334] [2022-03-18 22:14:52,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:14:52,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:14:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:14:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:14:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 173 proven. 57 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-03-18 22:14:52,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:14:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931778334] [2022-03-18 22:14:52,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931778334] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:14:52,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723227399] [2022-03-18 22:14:52,525 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-18 22:14:52,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:14:52,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:14:52,527 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-03-18 22:14:52,535 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-03-18 22:14:52,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-18 22:14:52,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:14:52,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-18 22:14:52,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:14:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 22:14:52,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:14:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-18 22:14:53,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723227399] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:14:53,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:14:53,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 16] total 31 [2022-03-18 22:14:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25894383] [2022-03-18 22:14:53,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:14:53,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-18 22:14:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:14:53,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-18 22:14:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2022-03-18 22:14:53,551 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:15:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 22:15:04,092 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2022-03-18 22:15:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-18 22:15:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-03-18 22:15:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 22:15:04,094 INFO L225 Difference]: With dead ends: 151 [2022-03-18 22:15:04,094 INFO L226 Difference]: Without dead ends: 117 [2022-03-18 22:15:04,095 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=924, Invalid=2382, Unknown=0, NotChecked=0, Total=3306 [2022-03-18 22:15:04,096 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 226 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-18 22:15:04,096 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 79 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-18 22:15:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-03-18 22:15:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-03-18 22:15:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:15:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2022-03-18 22:15:04,114 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 56 [2022-03-18 22:15:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 22:15:04,115 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2022-03-18 22:15:04,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.935483870967742) internal successors, (91), 30 states have internal predecessors, (91), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:15:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2022-03-18 22:15:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-18 22:15:04,117 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 22:15:04,117 INFO L500 BasicCegarLoop]: trace histogram [35, 35, 26, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 22:15:04,141 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-03-18 22:15:04,331 WARN L460 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-03-18 22:15:04,332 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 22:15:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 22:15:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2051530473, now seen corresponding path program 5 times [2022-03-18 22:15:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 22:15:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062277975] [2022-03-18 22:15:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 22:15:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 22:15:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:15:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 22:15:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 22:15:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 693 proven. 1027 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-03-18 22:15:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 22:15:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062277975] [2022-03-18 22:15:04,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062277975] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-18 22:15:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413027798] [2022-03-18 22:15:04,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-18 22:15:04,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-18 22:15:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 22:15:04,980 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-03-18 22:15:04,995 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-03-18 22:15:12,248 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2022-03-18 22:15:12,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-18 22:15:12,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-18 22:15:12,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-18 22:15:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-18 22:15:13,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-18 22:15:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1794 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-18 22:15:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413027798] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-18 22:15:15,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-18 22:15:15,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 32] total 88 [2022-03-18 22:15:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551656708] [2022-03-18 22:15:15,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-18 22:15:15,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-03-18 22:15:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-18 22:15:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-03-18 22:15:15,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=6684, Unknown=0, NotChecked=0, Total=7656 [2022-03-18 22:15:15,638 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 88 states, 88 states have (on average 3.102272727272727) internal successors, (273), 86 states have internal predecessors, (273), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 22:15:20,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (<= (+ (div c_main_~x~0 4294967296) 1) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= 0 (mod (+ 17 c_main_~y~0) 4294967296))) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (<= c_main_~x~0 26) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 22:15:22,685 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 16 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:15:24,696 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0))) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:15:29,061 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 15 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:17:20,708 WARN L232 SmtUtils]: Spent 43.36s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:19:10,404 WARN L232 SmtUtils]: Spent 41.65s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:19:16,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 14 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or .cse0 (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (or (not (< (mod (+ c_main_~x~0 1) 4294967296) 500000)) .cse0) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-03-18 22:21:01,183 WARN L232 SmtUtils]: Spent 41.56s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:21:14,455 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 22:21:21,580 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 13 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:22:37,069 WARN L232 SmtUtils]: Spent 28.76s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:22:48,393 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 12 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 22:24:15,058 WARN L232 SmtUtils]: Spent 26.43s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:24:18,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-18 22:24:20,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-18 22:25:44,275 WARN L232 SmtUtils]: Spent 35.72s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-18 22:25:46,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-18 22:26:01,114 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 22:26:11,601 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 11 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:27:39,159 WARN L232 SmtUtils]: Spent 25.52s 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-03-18 22:27:53,087 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-18 22:28:02,205 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod (+ 6 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967288 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 8 c_main_~y~0) 4294967296) 0)) (not (= (mod c_main_~y~0 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~y~0) 4294967296) 0)) (or (not (= (mod (+ 9 c_main_~y~0) 4294967296) 0)) (not (< (mod c_main_~x~0 4294967296) 500000))) (not (= (mod (+ 4294967287 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 7 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 2 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 5 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 1) 4294967296) 0)) (not (= (mod (+ 4 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 3 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~y~0) 4294967296) 0)) (not (= (mod (+ c_main_~y~0 4294967293) 4294967296) 0)) (not (= (mod (+ 10 c_main_~y~0) 4294967296) 0))) is different from false [2022-03-18 22:29:13,164 WARN L232 SmtUtils]: Spent 21.79s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)