/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/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 06:06:20,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 06:06:20,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 06:06:21,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 06:06:21,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 06:06:21,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 06:06:21,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 06:06:21,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 06:06:21,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 06:06:21,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 06:06:21,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 06:06:21,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 06:06:21,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 06:06:21,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 06:06:21,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 06:06:21,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 06:06:21,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 06:06:21,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 06:06:21,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 06:06:21,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 06:06:21,033 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 06:06:21,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 06:06:21,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 06:06:21,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 06:06:21,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 06:06:21,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 06:06:21,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 06:06:21,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 06:06:21,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 06:06:21,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 06:06:21,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 06:06:21,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 06:06:21,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 06:06:21,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 06:06:21,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 06:06:21,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 06:06:21,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 06:06:21,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 06:06:21,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 06:06:21,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 06:06:21,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 06:06:21,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 06:06:21,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 06:06:21,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 06:06:21,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 06:06:21,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 06:06:21,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 06:06:21,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 06:06:21,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 06:06:21,094 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 06:06:21,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 06:06:21,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 06:06:21,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 06:06:21,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 06:06:21,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 06:06:21,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 06:06:21,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:06:21,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 06:06:21,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 06:06:21,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 06:06:21,098 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 06:06:21,098 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-04-05 06:06:21,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 06:06:21,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 06:06:21,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 06:06:21,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 06:06:21,328 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 06:06:21,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-05 06:06:21,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc5dd23f/32ca77913c3149e2a5ab88bb146613c6/FLAG32f000e75 [2022-04-05 06:06:21,731 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 06:06:21,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-05 06:06:21,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc5dd23f/32ca77913c3149e2a5ab88bb146613c6/FLAG32f000e75 [2022-04-05 06:06:21,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc5dd23f/32ca77913c3149e2a5ab88bb146613c6 [2022-04-05 06:06:21,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 06:06:21,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 06:06:21,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 06:06:21,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 06:06:21,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 06:06:21,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55787094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21, skipping insertion in model container [2022-04-05 06:06:21,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 06:06:21,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 06:06:21,886 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/nested3-2.c[321,334] [2022-04-05 06:06:21,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:06:21,901 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 06:06:21,910 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/nested3-2.c[321,334] [2022-04-05 06:06:21,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 06:06:21,923 INFO L208 MainTranslator]: Completed translation [2022-04-05 06:06:21,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21 WrapperNode [2022-04-05 06:06:21,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 06:06:21,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 06:06:21,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 06:06:21,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 06:06:21,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 06:06:21,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 06:06:21,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 06:06:21,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 06:06:21,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (1/1) ... [2022-04-05 06:06:21,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 06:06:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:06:21,975 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-04-05 06:06:21,983 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-04-05 06:06:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 06:06:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 06:06:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 06:06:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 06:06:22,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 06:06:22,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 06:06:22,007 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 06:06:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 06:06:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 06:06:22,057 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 06:06:22,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 06:06:22,141 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 06:06:22,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 06:06:22,147 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-05 06:06:22,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:06:22 BoogieIcfgContainer [2022-04-05 06:06:22,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 06:06:22,149 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 06:06:22,149 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 06:06:22,150 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 06:06:22,152 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:06:22" (1/1) ... [2022-04-05 06:06:22,154 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 06:06:22,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:06:22 BasicIcfg [2022-04-05 06:06:22,166 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 06:06:22,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 06:06:22,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 06:06:22,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 06:06:22,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:06:21" (1/4) ... [2022-04-05 06:06:22,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a256af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:06:22, skipping insertion in model container [2022-04-05 06:06:22,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:06:21" (2/4) ... [2022-04-05 06:06:22,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a256af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:06:22, skipping insertion in model container [2022-04-05 06:06:22,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:06:22" (3/4) ... [2022-04-05 06:06:22,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a256af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:06:22, skipping insertion in model container [2022-04-05 06:06:22,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 06:06:22" (4/4) ... [2022-04-05 06:06:22,172 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-2.cqvasr [2022-04-05 06:06:22,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 06:06:22,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 06:06:22,208 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 06:06:22,214 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-04-05 06:06:22,214 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 06:06:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-05 06:06:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 06:06:22,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:22,230 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:22,231 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1301415802, now seen corresponding path program 1 times [2022-04-05 06:06:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:22,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580830602] [2022-04-05 06:06:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580830602] [2022-04-05 06:06:22,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580830602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:06:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:06:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 06:06:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372129409] [2022-04-05 06:06:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:06:22,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 06:06:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 06:06:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 06:06:22,484 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-04-05 06:06:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:22,556 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-05 06:06:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 06:06:22,561 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-04-05 06:06:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:22,567 INFO L225 Difference]: With dead ends: 44 [2022-04-05 06:06:22,567 INFO L226 Difference]: Without dead ends: 20 [2022-04-05 06:06:22,570 INFO L912 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-04-05 06:06:22,574 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:22,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:06:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-05 06:06:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-05 06:06:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-05 06:06:22,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-05 06:06:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:22,605 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-05 06:06:22,605 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-04-05 06:06:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-05 06:06:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 06:06:22,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:22,606 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:22,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 06:06:22,607 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1302339323, now seen corresponding path program 1 times [2022-04-05 06:06:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:22,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614447822] [2022-04-05 06:06:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:22,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614447822] [2022-04-05 06:06:22,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614447822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:06:22,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:06:22,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:06:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458413224] [2022-04-05 06:06:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:06:22,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 06:06:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 06:06:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:06:22,712 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-04-05 06:06:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:22,789 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-05 06:06:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 06:06:22,789 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-04-05 06:06:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:22,790 INFO L225 Difference]: With dead ends: 34 [2022-04-05 06:06:22,790 INFO L226 Difference]: Without dead ends: 27 [2022-04-05 06:06:22,791 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:06:22,792 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:22,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:06:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-05 06:06:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-05 06:06:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-05 06:06:22,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-05 06:06:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:22,799 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-05 06:06:22,800 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-04-05 06:06:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-05 06:06:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 06:06:22,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:22,800 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:22,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 06:06:22,801 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1748313539, now seen corresponding path program 1 times [2022-04-05 06:06:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:22,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66095427] [2022-04-05 06:06:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:22,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66095427] [2022-04-05 06:06:22,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66095427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:06:22,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:06:22,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:06:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082118045] [2022-04-05 06:06:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:06:22,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 06:06:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 06:06:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:06:22,867 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-05 06:06:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:22,913 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-05 06:06:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 06:06:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-05 06:06:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:22,915 INFO L225 Difference]: With dead ends: 39 [2022-04-05 06:06:22,916 INFO L226 Difference]: Without dead ends: 25 [2022-04-05 06:06:22,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:06:22,917 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:22,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:06:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-05 06:06:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-05 06:06:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-05 06:06:22,923 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-05 06:06:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:22,923 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-05 06:06:22,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-05 06:06:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-05 06:06:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-05 06:06:22,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:22,924 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:22,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 06:06:22,925 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:22,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1606116621, now seen corresponding path program 1 times [2022-04-05 06:06:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:22,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580913324] [2022-04-05 06:06:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580913324] [2022-04-05 06:06:23,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580913324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 06:06:23,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 06:06:23,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 06:06:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821504397] [2022-04-05 06:06:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 06:06:23,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 06:06:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 06:06:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 06:06:23,004 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-04-05 06:06:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:23,043 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-05 06:06:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 06:06:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-05 06:06:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:23,045 INFO L225 Difference]: With dead ends: 39 [2022-04-05 06:06:23,045 INFO L226 Difference]: Without dead ends: 24 [2022-04-05 06:06:23,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-05 06:06:23,047 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:23,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 06:06:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-05 06:06:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-05 06:06:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-05 06:06:23,053 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-05 06:06:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:23,053 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-05 06:06:23,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-04-05 06:06:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-05 06:06:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-05 06:06:23,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:23,054 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:23,054 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 06:06:23,054 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:23,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1773342651, now seen corresponding path program 1 times [2022-04-05 06:06:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:23,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657478006] [2022-04-05 06:06:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:23,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:23,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657478006] [2022-04-05 06:06:23,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657478006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:06:23,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068596525] [2022-04-05 06:06:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:23,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:23,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:06:23,127 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-04-05 06:06:23,163 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-04-05 06:06:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 06:06:23,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:06:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:06:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068596525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:06:23,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:06:23,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-05 06:06:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437326878] [2022-04-05 06:06:23,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:06:23,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 06:06:23,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:23,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 06:06:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 06:06:23,286 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-04-05 06:06:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:23,402 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-05 06:06:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 06:06:23,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 14 [2022-04-05 06:06:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:23,404 INFO L225 Difference]: With dead ends: 43 [2022-04-05 06:06:23,404 INFO L226 Difference]: Without dead ends: 27 [2022-04-05 06:06:23,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-05 06:06:23,408 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:23,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 38 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:06:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-05 06:06:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-05 06:06:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-05 06:06:23,428 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2022-04-05 06:06:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:23,428 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-05 06:06:23,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-04-05 06:06:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-05 06:06:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 06:06:23,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:23,429 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:23,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-05 06:06:23,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:23,651 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1029731085, now seen corresponding path program 2 times [2022-04-05 06:06:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:23,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586779449] [2022-04-05 06:06:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586779449] [2022-04-05 06:06:23,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586779449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:06:23,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435279382] [2022-04-05 06:06:23,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 06:06:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:23,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:06:23,861 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-04-05 06:06:23,862 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-04-05 06:06:23,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 06:06:23,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:06:23,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-05 06:06:23,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:06:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:23,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:06:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:24,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435279382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:06:24,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:06:24,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-05 06:06:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975741052] [2022-04-05 06:06:24,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:06:24,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 06:06:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 06:06:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-05 06:06:24,112 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-04-05 06:06:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:24,536 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-05 06:06:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 06:06:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 17 [2022-04-05 06:06:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:24,538 INFO L225 Difference]: With dead ends: 52 [2022-04-05 06:06:24,538 INFO L226 Difference]: Without dead ends: 33 [2022-04-05 06:06:24,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-05 06:06:24,540 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:24,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 06:06:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-05 06:06:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-05 06:06:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-05 06:06:24,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 17 [2022-04-05 06:06:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:24,548 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-05 06:06:24,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-04-05 06:06:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-05 06:06:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 06:06:24,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:24,549 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:24,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 06:06:24,767 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,SelfDestructingSolverStorable5 [2022-04-05 06:06:24,767 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -531163149, now seen corresponding path program 3 times [2022-04-05 06:06:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669708098] [2022-04-05 06:06:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:24,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:24,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669708098] [2022-04-05 06:06:24,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669708098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:06:24,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530535001] [2022-04-05 06:06:24,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 06:06:24,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:24,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:06:24,972 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-04-05 06:06:25,001 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-04-05 06:06:25,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-05 06:06:25,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:06:25,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-05 06:06:25,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:06:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:25,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:06:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:25,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530535001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:06:25,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:06:25,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-05 06:06:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526490833] [2022-04-05 06:06:25,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:06:25,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-05 06:06:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:25,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-05 06:06:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-05 06:06:25,460 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-04-05 06:06:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:06:29,908 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2022-04-05 06:06:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-05 06:06:29,908 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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 23 [2022-04-05 06:06:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:06:29,909 INFO L225 Difference]: With dead ends: 70 [2022-04-05 06:06:29,909 INFO L226 Difference]: Without dead ends: 45 [2022-04-05 06:06:29,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-04-05 06:06:29,911 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 06:06:29,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 78 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 06:06:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-05 06:06:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-04-05 06:06:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:06:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-05 06:06:29,923 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 23 [2022-04-05 06:06:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:06:29,923 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-05 06:06:29,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 25 states have internal predecessors, (34), 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-04-05 06:06:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-05 06:06:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-05 06:06:29,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:06:29,924 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:06:29,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-05 06:06:30,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:30,131 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:06:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:06:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash 45706739, now seen corresponding path program 4 times [2022-04-05 06:06:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:06:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551458063] [2022-04-05 06:06:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:06:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:06:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:06:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:30,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:06:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551458063] [2022-04-05 06:06:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551458063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:06:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898160871] [2022-04-05 06:06:30,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 06:06:30,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:06:30,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:06:30,615 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-04-05 06:06:30,636 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-04-05 06:06:30,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 06:06:30,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:06:30,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-05 06:06:30,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:06:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:30,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:06:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:06:31,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898160871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:06:31,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:06:31,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-05 06:06:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885325425] [2022-04-05 06:06:31,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:06:31,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-05 06:06:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-05 06:06:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-05 06:06:31,754 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 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-04-05 06:08:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:08:18,667 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-04-05 06:08:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-05 06:08:18,668 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 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 35 [2022-04-05 06:08:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:08:18,669 INFO L225 Difference]: With dead ends: 106 [2022-04-05 06:08:18,669 INFO L226 Difference]: Without dead ends: 69 [2022-04-05 06:08:18,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 107.4s TimeCoverageRelationStatistics Valid=2441, Invalid=6677, Unknown=2, NotChecked=0, Total=9120 [2022-04-05 06:08:18,673 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 06:08:18,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 138 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 06:08:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-05 06:08:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-05 06:08:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-05 06:08:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-05 06:08:18,704 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 35 [2022-04-05 06:08:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:08:18,704 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-05 06:08:18,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.16) internal successors, (58), 49 states have internal predecessors, (58), 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-04-05 06:08:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-05 06:08:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-05 06:08:18,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:08:18,709 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:08:18,767 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-04-05 06:08:18,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:08:18,909 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:08:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:08:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2089490931, now seen corresponding path program 5 times [2022-04-05 06:08:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:08:18,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735817893] [2022-04-05 06:08:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:08:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:08:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:08:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:08:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:08:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:08:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:08:20,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735817893] [2022-04-05 06:08:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735817893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:08:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927688419] [2022-04-05 06:08:20,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 06:08:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:08:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:08:20,304 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-04-05 06:08:20,306 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-04-05 06:09:00,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-05 06:09:00,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:09:00,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-05 06:09:00,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:09:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:00,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:09:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 06:09:04,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927688419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:09:04,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:09:04,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-05 06:09:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168080199] [2022-04-05 06:09:04,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:09:04,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-05 06:09:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:09:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-05 06:09:04,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-05 06:09:04,145 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 98 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 97 states have internal predecessors, (106), 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-04-05 06:10:19,396 WARN L232 SmtUtils]: Spent 19.09s on a formula simplification. DAG size of input: 196 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:11:17,108 WARN L232 SmtUtils]: Spent 21.17s on a formula simplification. DAG size of input: 192 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:12:20,875 WARN L232 SmtUtils]: Spent 14.18s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:13:27,960 WARN L232 SmtUtils]: Spent 12.46s on a formula simplification. DAG size of input: 184 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:13:29,977 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 37 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-05 06:13:31,990 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 39 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 37 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 41 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-05 06:14:40,612 WARN L232 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 166 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:15:50,450 WARN L232 SmtUtils]: Spent 11.14s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:15:52,471 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 37 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 35 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-05 06:17:00,908 WARN L232 SmtUtils]: Spent 10.12s on a formula simplification. DAG size of input: 154 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:18:04,720 WARN L232 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 156 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:19:10,463 WARN L232 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 152 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:19:12,485 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 11 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 9 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 23 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 27) 4294967296) 268435455) (< (mod (+ 13 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 21 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 30 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 33 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 25 c_main_~z~0) 4294967296) 268435455) (< (mod c_main_~z~0 4294967296) 268435455) (< (mod (+ 2 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 31 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 15 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 24) 4294967296) 268435455) (< (mod (+ 6 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 5 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 19 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 3 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 20 c_main_~z~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 17 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 29 c_main_~z~0) 4294967296) 268435455) (< (mod (+ 7 c_main_~z~0) 4294967296) 268435455) (< (mod (+ c_main_~z~0 1) 4294967296) 268435455)) is different from false [2022-04-05 06:20:20,089 WARN L232 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 138 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)