/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:53:42,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:53:42,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:53:42,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:53:42,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:53:42,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:53:42,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:53:42,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:53:42,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:53:42,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:53:42,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:53:42,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:53:42,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:53:42,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:53:42,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:53:42,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:53:42,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:53:42,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:53:42,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:53:42,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:53:42,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:53:42,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:53:42,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:53:42,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:53:42,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:53:42,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:53:42,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:53:42,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:53:42,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:53:42,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:53:42,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:53:42,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:53:42,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:53:42,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:53:42,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:53:42,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:53:42,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:53:42,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:53:42,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:53:42,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:53:42,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:53:42,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:53:42,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:53:42,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:53:42,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:53:42,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:53:42,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:53:42,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:53:42,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:53:42,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:53:42,239 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:53:42,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:53:42,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:53:42,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:53:42,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:53:42,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:53:42,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:42,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:53:42,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:53:42,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:53:42,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:53:42,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:53:42,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:53:42,599 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:53:42,603 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:53:42,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 00:53:42,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d4abf62/342a7d54c66d4a2980fa8bf8a722d4be/FLAGc38bfee8e [2022-01-10 00:53:43,064 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:53:43,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i [2022-01-10 00:53:43,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d4abf62/342a7d54c66d4a2980fa8bf8a722d4be/FLAGc38bfee8e [2022-01-10 00:53:43,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d4abf62/342a7d54c66d4a2980fa8bf8a722d4be [2022-01-10 00:53:43,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:53:43,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:53:43,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:43,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:53:43,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:53:43,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1e1c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43, skipping insertion in model container [2022-01-10 00:53:43,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:53:43,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:53:43,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 00:53:43,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:43,773 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:53:43,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-01-10 00:53:43,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:53:43,828 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:53:43,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43 WrapperNode [2022-01-10 00:53:43,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:53:43,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:43,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:53:43,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:53:43,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,880 INFO L137 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2022-01-10 00:53:43,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:53:43,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:53:43,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:53:43,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:53:43,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:53:43,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:53:43,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:53:43,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:53:43,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (1/1) ... [2022-01-10 00:53:43,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:53:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:43,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:53:43,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:53:43,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 00:53:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:53:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:53:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:53:44,078 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:53:44,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:53:44,343 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:53:44,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:53:44,349 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 00:53:44,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:44 BoogieIcfgContainer [2022-01-10 00:53:44,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:53:44,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:53:44,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:53:44,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:53:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:43" (1/3) ... [2022-01-10 00:53:44,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749ef589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:44, skipping insertion in model container [2022-01-10 00:53:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:43" (2/3) ... [2022-01-10 00:53:44,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749ef589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:44, skipping insertion in model container [2022-01-10 00:53:44,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:44" (3/3) ... [2022-01-10 00:53:44,356 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-01-10 00:53:44,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:53:44,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:53:44,386 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:53:44,389 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:53:44,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:53:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:53:44,402 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:44,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:44,402 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:44,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-01-10 00:53:44,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535298511] [2022-01-10 00:53:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:44,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:53:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:53:44,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:44,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535298511] [2022-01-10 00:53:44,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535298511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:44,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:44,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:53:44,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505548036] [2022-01-10 00:53:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:44,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:53:44,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:53:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:53:44,596 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:44,679 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-01-10 00:53:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:53:44,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 00:53:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:44,686 INFO L225 Difference]: With dead ends: 79 [2022-01-10 00:53:44,686 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 00:53:44,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:53:44,692 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:44,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 00:53:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-10 00:53:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-01-10 00:53:44,718 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-01-10 00:53:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:44,719 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-01-10 00:53:44,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-01-10 00:53:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:53:44,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:44,722 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:44,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:53:44,723 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:44,724 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-01-10 00:53:44,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:44,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742498721] [2022-01-10 00:53:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:44,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:53:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:53:44,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742498721] [2022-01-10 00:53:44,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742498721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:44,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:44,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:53:44,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43352541] [2022-01-10 00:53:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:44,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:53:44,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:44,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:53:44,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:44,871 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:44,941 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-01-10 00:53:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:53:44,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 00:53:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:44,944 INFO L225 Difference]: With dead ends: 68 [2022-01-10 00:53:44,944 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 00:53:44,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:44,945 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:44,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 00:53:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-10 00:53:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-01-10 00:53:44,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-01-10 00:53:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:44,951 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-01-10 00:53:44,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:53:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-01-10 00:53:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:53:44,952 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:44,952 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:44,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:53:44,952 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:44,952 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-01-10 00:53:44,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:44,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970680126] [2022-01-10 00:53:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:44,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:45,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:45,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970680126] [2022-01-10 00:53:45,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970680126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:45,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:45,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:53:45,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248163305] [2022-01-10 00:53:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:45,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:53:45,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:53:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:45,065 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:53:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:45,124 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-01-10 00:53:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:53:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-01-10 00:53:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:45,126 INFO L225 Difference]: With dead ends: 67 [2022-01-10 00:53:45,126 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:53:45,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:53:45,131 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:45,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:53:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:53:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-01-10 00:53:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:53:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-01-10 00:53:45,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2022-01-10 00:53:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:45,136 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-01-10 00:53:45,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:53:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-01-10 00:53:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:53:45,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:45,137 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:45,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:53:45,137 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-01-10 00:53:45,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:45,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986982027] [2022-01-10 00:53:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:45,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:53:46,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986982027] [2022-01-10 00:53:46,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986982027] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:46,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345174171] [2022-01-10 00:53:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:46,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:46,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:53:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:53:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:46,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 144 conjunts are in the unsatisfiable core [2022-01-10 00:53:46,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:46,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:53:46,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:53:47,098 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:53:47,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:53:47,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:53:47,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:53:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:47,439 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:53:47,439 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-01-10 00:53:47,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:53:47,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:47,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 00:53:47,628 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:53:47,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2022-01-10 00:53:47,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-10 00:53:47,864 INFO L353 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-01-10 00:53:47,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 55 [2022-01-10 00:53:47,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:47,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-01-10 00:53:47,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2022-01-10 00:53:48,117 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-01-10 00:53:48,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 38 [2022-01-10 00:53:48,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 00:53:48,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 00:53:48,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 00:53:48,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,358 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 00:53:48,358 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 82 [2022-01-10 00:53:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:53:48,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,381 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 00:53:48,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 00:53:48,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:53:48,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,838 INFO L353 Elim1Store]: treesize reduction 152, result has 9.5 percent of original size [2022-01-10 00:53:48,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 185 treesize of output 140 [2022-01-10 00:53:48,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2022-01-10 00:53:48,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:48,873 INFO L353 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-01-10 00:53:48,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2022-01-10 00:53:48,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-01-10 00:53:48,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 00:53:48,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-10 00:53:48,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-10 00:53:48,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:53:49,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:53:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:53:49,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:53:49,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_730)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_724) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_728) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-01-10 00:53:49,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_730)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_727) .cse0 v_ArrVal_724) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_729) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_726) .cse0 v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_728) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_723) .cse0 v_ArrVal_720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-01-10 00:53:49,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_730)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_727) .cse2 v_ArrVal_724) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_729) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_726) .cse2 v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_728) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_723) .cse2 v_ArrVal_720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-01-10 00:53:49,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_720 (Array Int Int)) (v_ArrVal_741 (Array Int Int)) (v_ArrVal_730 Int) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| Int) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_729 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_741)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_739))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_740))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_730))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_727) .cse3 v_ArrVal_724) (select (select (store (store (store .cse4 .cse1 v_ArrVal_729) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_726) .cse3 v_ArrVal_721) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 16 (select (select (store (store (store .cse5 .cse1 v_ArrVal_728) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_723) .cse3 v_ArrVal_720) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|) 0)))) is different from false [2022-01-10 00:53:49,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345174171] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:49,264 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:53:49,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-01-10 00:53:49,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224154974] [2022-01-10 00:53:49,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:53:49,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-10 00:53:49,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-10 00:53:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2109, Unknown=6, NotChecked=380, Total=2652 [2022-01-10 00:53:49,266 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:53:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:50,148 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-10 00:53:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:53:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-01-10 00:53:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:50,151 INFO L225 Difference]: With dead ends: 71 [2022-01-10 00:53:50,152 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 00:53:50,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=210, Invalid=2662, Unknown=6, NotChecked=428, Total=3306 [2022-01-10 00:53:50,153 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:50,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 549 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 708 Invalid, 0 Unknown, 154 Unchecked, 0.5s Time] [2022-01-10 00:53:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 00:53:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2022-01-10 00:53:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:53:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-01-10 00:53:50,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2022-01-10 00:53:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:50,160 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-01-10 00:53:50,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:53:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-01-10 00:53:50,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:53:50,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:50,161 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:50,181 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-01-10 00:53:50,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:50,379 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:50,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2022-01-10 00:53:50,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:50,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946228573] [2022-01-10 00:53:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:50,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:50,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946228573] [2022-01-10 00:53:50,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946228573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:50,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:50,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:53:50,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299824001] [2022-01-10 00:53:50,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:50,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:53:50,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:53:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:53:50,484 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:53:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:50,562 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-01-10 00:53:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:53:50,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-01-10 00:53:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:50,563 INFO L225 Difference]: With dead ends: 70 [2022-01-10 00:53:50,564 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:53:50,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:53:50,564 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:50,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:53:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 00:53:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:53:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-01-10 00:53:50,570 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 37 [2022-01-10 00:53:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:50,570 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-01-10 00:53:50,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:53:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-01-10 00:53:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:53:50,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:50,571 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:50,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:53:50,571 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2022-01-10 00:53:50,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315977935] [2022-01-10 00:53:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:50,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:50,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:50,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315977935] [2022-01-10 00:53:50,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315977935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:53:50,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:53:50,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:53:50,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016065099] [2022-01-10 00:53:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:53:50,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:53:50,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:53:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:53:50,640 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:53:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:50,689 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-10 00:53:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:53:50,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-01-10 00:53:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:50,690 INFO L225 Difference]: With dead ends: 71 [2022-01-10 00:53:50,690 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:53:50,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:53:50,691 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 75 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:50,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 86 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:53:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:53:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 00:53:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:53:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-01-10 00:53:50,710 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 37 [2022-01-10 00:53:50,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:50,711 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-01-10 00:53:50,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:53:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-01-10 00:53:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 00:53:50,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:50,712 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:50,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:53:50,712 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:50,712 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2022-01-10 00:53:50,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:50,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595586500] [2022-01-10 00:53:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:50,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:50,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:50,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595586500] [2022-01-10 00:53:50,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595586500] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:50,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884119373] [2022-01-10 00:53:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:50,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:50,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:53:50,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:53:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:51,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 00:53:51,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:51,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:53:51,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:53:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:51,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:53:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:53:51,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884119373] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:53:51,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:53:51,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-01-10 00:53:51,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19312440] [2022-01-10 00:53:51,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:53:51,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 00:53:51,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:51,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 00:53:51,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:53:51,449 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:53:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:51,549 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-01-10 00:53:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:53:51,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-10 00:53:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:51,550 INFO L225 Difference]: With dead ends: 82 [2022-01-10 00:53:51,550 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 00:53:51,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:53:51,551 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:51,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:53:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 00:53:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-01-10 00:53:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:53:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-01-10 00:53:51,556 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 38 [2022-01-10 00:53:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:51,557 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-01-10 00:53:51,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:53:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-01-10 00:53:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 00:53:51,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:51,557 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:51,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:53:51,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-10 00:53:51,775 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:51,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2022-01-10 00:53:51,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:51,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870022577] [2022-01-10 00:53:51,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:51,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:51,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:51,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:53:51,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:51,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870022577] [2022-01-10 00:53:51,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870022577] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:51,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292533609] [2022-01-10 00:53:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:51,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:51,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:52,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:53:52,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:53:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:52,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-10 00:53:52,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:52,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-10 00:53:52,516 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2617 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2617) |c_#memory_$Pointer$.base|)))) is different from true [2022-01-10 00:53:52,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:53:52,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-01-10 00:53:52,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-10 00:53:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-10 00:53:52,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:53:52,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_2620 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_2620) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2022-01-10 00:53:52,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292533609] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:52,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:53:52,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-01-10 00:53:52,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968759131] [2022-01-10 00:53:52,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:53:52,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 00:53:52,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:53:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 00:53:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=622, Unknown=2, NotChecked=102, Total=812 [2022-01-10 00:53:52,703 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:53:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:53:53,070 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-01-10 00:53:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 00:53:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-01-10 00:53:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:53:53,072 INFO L225 Difference]: With dead ends: 67 [2022-01-10 00:53:53,072 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 00:53:53,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1041, Unknown=2, NotChecked=134, Total=1332 [2022-01-10 00:53:53,073 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:53:53,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 296 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-01-10 00:53:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 00:53:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-01-10 00:53:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:53:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-01-10 00:53:53,084 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2022-01-10 00:53:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:53:53,084 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-01-10 00:53:53,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:53:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-01-10 00:53:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 00:53:53,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:53:53,085 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:53:53,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 00:53:53,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:53,302 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:53:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:53:53,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2022-01-10 00:53:53,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:53:53,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385581117] [2022-01-10 00:53:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:53,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:53:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:53:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:53:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 00:53:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:53:54,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:53:54,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385581117] [2022-01-10 00:53:54,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385581117] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:53:54,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890009149] [2022-01-10 00:53:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:53:54,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:54,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:53:54,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:53:54,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:53:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:53:54,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 160 conjunts are in the unsatisfiable core [2022-01-10 00:53:54,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:53:54,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:53:54,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:53:55,111 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 00:53:55,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:53:55,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:53:55,312 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 146671 column 46: unknown constant v_#valid_BEFORE_CALL_8 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 00:53:55,315 INFO L158 Benchmark]: Toolchain (without parser) took 11857.35ms. Allocated memory was 229.6MB in the beginning and 383.8MB in the end (delta: 154.1MB). Free memory was 177.8MB in the beginning and 223.8MB in the end (delta: -46.0MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,315 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 195.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:53:55,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.91ms. Allocated memory is still 229.6MB. Free memory was 177.7MB in the beginning and 196.0MB in the end (delta: -18.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.35ms. Allocated memory is still 229.6MB. Free memory was 196.0MB in the beginning and 193.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,315 INFO L158 Benchmark]: Boogie Preprocessor took 54.08ms. Allocated memory is still 229.6MB. Free memory was 193.5MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,316 INFO L158 Benchmark]: RCFGBuilder took 414.98ms. Allocated memory is still 229.6MB. Free memory was 191.9MB in the beginning and 172.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,316 INFO L158 Benchmark]: TraceAbstraction took 10963.07ms. Allocated memory was 229.6MB in the beginning and 383.8MB in the end (delta: 154.1MB). Free memory was 171.5MB in the beginning and 223.8MB in the end (delta: -52.4MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. [2022-01-10 00:53:55,317 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory is still 195.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.91ms. Allocated memory is still 229.6MB. Free memory was 177.7MB in the beginning and 196.0MB in the end (delta: -18.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.35ms. Allocated memory is still 229.6MB. Free memory was 196.0MB in the beginning and 193.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.08ms. Allocated memory is still 229.6MB. Free memory was 193.5MB in the beginning and 191.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.98ms. Allocated memory is still 229.6MB. Free memory was 191.9MB in the beginning and 172.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10963.07ms. Allocated memory was 229.6MB in the beginning and 383.8MB in the end (delta: 154.1MB). Free memory was 171.5MB in the beginning and 223.8MB in the end (delta: -52.4MB). Peak memory consumption was 103.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 146671 column 46: unknown constant v_#valid_BEFORE_CALL_8 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 146671 column 46: unknown constant v_#valid_BEFORE_CALL_8: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 00:53:55,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request...