./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/vnew2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/vnew2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 10:50:25,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 10:50:25,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 10:50:25,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 10:50:25,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 10:50:25,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 10:50:25,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 10:50:25,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 10:50:25,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 10:50:25,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 10:50:25,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 10:50:25,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 10:50:25,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 10:50:25,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 10:50:25,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 10:50:25,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 10:50:25,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 10:50:25,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 10:50:25,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 10:50:25,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 10:50:25,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 10:50:25,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 10:50:25,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 10:50:25,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 10:50:25,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 10:50:25,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 10:50:25,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 10:50:25,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 10:50:25,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 10:50:25,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 10:50:25,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 10:50:25,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 10:50:25,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 10:50:25,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 10:50:25,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 10:50:25,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 10:50:25,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 10:50:25,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 10:50:25,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 10:50:25,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 10:50:25,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 10:50:25,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 10:50:25,362 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 10:50:25,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 10:50:25,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 10:50:25,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 10:50:25,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 10:50:25,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 10:50:25,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 10:50:25,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 10:50:25,364 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 10:50:25,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 10:50:25,365 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 10:50:25,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 10:50:25,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 10:50:25,366 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 10:50:25,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 10:50:25,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 10:50:25,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 10:50:25,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 10:50:25,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:50:25,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 10:50:25,368 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 10:50:25,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 10:50:25,369 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 10:50:25,369 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f [2021-12-17 10:50:25,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 10:50:25,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 10:50:25,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 10:50:25,592 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 10:50:25,592 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 10:50:25,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/vnew2.c [2021-12-17 10:50:25,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aa103f1/30942a55a98f40debee648c96b4c9a12/FLAG9b7b9d22f [2021-12-17 10:50:25,972 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 10:50:25,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/vnew2.c [2021-12-17 10:50:25,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aa103f1/30942a55a98f40debee648c96b4c9a12/FLAG9b7b9d22f [2021-12-17 10:50:25,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4aa103f1/30942a55a98f40debee648c96b4c9a12 [2021-12-17 10:50:25,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 10:50:26,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 10:50:26,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 10:50:26,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 10:50:26,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 10:50:26,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:50:25" (1/1) ... [2021-12-17 10:50:26,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1d1a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26, skipping insertion in model container [2021-12-17 10:50:26,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:50:25" (1/1) ... [2021-12-17 10:50:26,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 10:50:26,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 10:50:26,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2021-12-17 10:50:26,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:50:26,169 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 10:50:26,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/vnew2.c[403,416] [2021-12-17 10:50:26,187 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 10:50:26,197 INFO L208 MainTranslator]: Completed translation [2021-12-17 10:50:26,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26 WrapperNode [2021-12-17 10:50:26,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 10:50:26,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 10:50:26,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 10:50:26,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 10:50:26,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,235 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2021-12-17 10:50:26,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 10:50:26,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 10:50:26,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 10:50:26,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 10:50:26,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 10:50:26,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 10:50:26,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 10:50:26,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 10:50:26,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (1/1) ... [2021-12-17 10:50:26,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 10:50:26,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:50:26,290 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) [2021-12-17 10:50:26,308 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 [2021-12-17 10:50:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 10:50:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 10:50:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 10:50:26,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 10:50:26,363 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 10:50:26,364 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 10:50:26,432 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 10:50:26,435 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 10:50:26,435 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 10:50:26,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:50:26 BoogieIcfgContainer [2021-12-17 10:50:26,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 10:50:26,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 10:50:26,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 10:50:26,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 10:50:26,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:50:25" (1/3) ... [2021-12-17 10:50:26,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f813302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:50:26, skipping insertion in model container [2021-12-17 10:50:26,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:50:26" (2/3) ... [2021-12-17 10:50:26,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f813302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:50:26, skipping insertion in model container [2021-12-17 10:50:26,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:50:26" (3/3) ... [2021-12-17 10:50:26,442 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.c [2021-12-17 10:50:26,445 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 10:50:26,445 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 10:50:26,479 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 10:50:26,484 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 [2021-12-17 10:50:26,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 10:50:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 10:50:26,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:50:26,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:50:26,499 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:50:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:50:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1807091466, now seen corresponding path program 1 times [2021-12-17 10:50:26,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:50:26,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605182909] [2021-12-17 10:50:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:26,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:50:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:50:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:26,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:50:26,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605182909] [2021-12-17 10:50:26,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605182909] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:50:26,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:50:26,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 10:50:26,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091659731] [2021-12-17 10:50:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:50:26,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 10:50:26,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:50:26,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 10:50:26,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:50:26,648 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:50:26,659 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2021-12-17 10:50:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 10:50:26,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 10:50:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:50:26,666 INFO L225 Difference]: With dead ends: 22 [2021-12-17 10:50:26,666 INFO L226 Difference]: Without dead ends: 8 [2021-12-17 10:50:26,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 10:50:26,672 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:50:26,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:50:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-17 10:50:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-17 10:50:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-17 10:50:26,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-12-17 10:50:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:50:26,696 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-17 10:50:26,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-17 10:50:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-17 10:50:26,696 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:50:26,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:50:26,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 10:50:26,698 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:50:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:50:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1806972302, now seen corresponding path program 1 times [2021-12-17 10:50:26,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:50:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700202598] [2021-12-17 10:50:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:26,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:50:26,729 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 10:50:26,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366872670] [2021-12-17 10:50:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:26,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:50:26,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:50:26,731 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) [2021-12-17 10:50:26,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 10:50:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:50:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 10:50:26,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:50:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:26,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 10:50:26,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:50:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700202598] [2021-12-17 10:50:26,861 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 10:50:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366872670] [2021-12-17 10:50:26,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366872670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 10:50:26,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 10:50:26,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 10:50:26,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726586559] [2021-12-17 10:50:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 10:50:26,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 10:50:26,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:50:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 10:50:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 10:50:26,864 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:50:26,898 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-12-17 10:50:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 10:50:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-17 10:50:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:50:26,899 INFO L225 Difference]: With dead ends: 13 [2021-12-17 10:50:26,899 INFO L226 Difference]: Without dead ends: 9 [2021-12-17 10:50:26,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 10:50:26,900 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 10:50:26,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 10:50:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-12-17 10:50:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-12-17 10:50:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-12-17 10:50:26,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-12-17 10:50:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:50:26,902 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-12-17 10:50:26,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-12-17 10:50:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 10:50:26,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:50:26,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:50:26,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 10:50:27,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:50:27,104 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:50:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:50:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 183172310, now seen corresponding path program 1 times [2021-12-17 10:50:27,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:50:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896779469] [2021-12-17 10:50:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:27,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:50:27,112 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 10:50:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120682831] [2021-12-17 10:50:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:27,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:50:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:50:27,117 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) [2021-12-17 10:50:27,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 10:50:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 10:50:27,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 10:50:27,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:50:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:27,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:50:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:27,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:50:27,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896779469] [2021-12-17 10:50:27,706 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 10:50:27,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120682831] [2021-12-17 10:50:27,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120682831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:50:27,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 10:50:27,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-17 10:50:27,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479547975] [2021-12-17 10:50:27,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 10:50:27,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 10:50:27,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:50:27,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 10:50:27,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 10:50:27,708 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:30,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:50:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:50:34,350 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-12-17 10:50:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 10:50:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 10:50:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:50:34,351 INFO L225 Difference]: With dead ends: 20 [2021-12-17 10:50:34,351 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 10:50:34,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2021-12-17 10:50:34,352 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-12-17 10:50:34,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2021-12-17 10:50:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 10:50:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-17 10:50:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-12-17 10:50:34,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2021-12-17 10:50:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:50:34,355 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-12-17 10:50:34,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-12-17 10:50:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 10:50:34,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:50:34,356 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:50:34,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 10:50:34,560 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,SelfDestructingSolverStorable2 [2021-12-17 10:50:34,560 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:50:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:50:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -422590578, now seen corresponding path program 2 times [2021-12-17 10:50:34,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:50:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249727] [2021-12-17 10:50:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:50:34,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:50:34,572 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 10:50:34,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607403291] [2021-12-17 10:50:34,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 10:50:34,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:50:34,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:50:34,575 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) [2021-12-17 10:50:34,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 10:50:34,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 10:50:34,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:50:34,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-17 10:50:34,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:50:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:34,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:50:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:50:35,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:50:35,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249727] [2021-12-17 10:50:35,504 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 10:50:35,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607403291] [2021-12-17 10:50:35,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607403291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:50:35,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 10:50:35,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-17 10:50:35,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797774872] [2021-12-17 10:50:35,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 10:50:35,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 10:50:35,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:50:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 10:50:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-17 10:50:35,506 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:50:37,569 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse6 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (.cse8 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 9) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296)) (.cse4 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296)) (.cse7 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296)) (.cse10 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 12) 4294967296)) (.cse3 (mod (+ c_~SIZE~0 2) 4294967296))) (and (= .cse0 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 3) 4294967296)) (= .cse1 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 9) 4294967296)) (not (= 0 (mod (mod .cse2 .cse3) 4294967296))) (= .cse4 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 6) 4294967296)) (= .cse5 .cse6) (not (= 0 (mod (mod .cse5 .cse3) 4294967296))) (= .cse7 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 12) 4294967296)) (not (= 0 (mod (mod .cse8 .cse3) 4294967296))) (= .cse6 (mod |c_ULTIMATE.start_main_~k~0#1| 4294967296)) (= .cse8 .cse1) (= c_~SIZE~0 20000001) (= .cse2 .cse0) (= .cse9 .cse4) (not (= 0 (mod (mod .cse9 .cse3) 4294967296))) (= .cse10 .cse7) (not (= 0 (mod (mod .cse10 .cse3) 4294967296))))) is different from false [2021-12-17 10:50:42,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:50:52,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:50:58,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:51:04,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:51:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 10:51:05,579 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2021-12-17 10:51:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 10:51:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-17 10:51:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 10:51:05,580 INFO L225 Difference]: With dead ends: 30 [2021-12-17 10:51:05,580 INFO L226 Difference]: Without dead ends: 18 [2021-12-17 10:51:05,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=145, Invalid=362, Unknown=3, NotChecked=42, Total=552 [2021-12-17 10:51:05,582 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-12-17 10:51:05,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 19 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 79 Invalid, 2 Unknown, 2 Unchecked, 9.4s Time] [2021-12-17 10:51:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-17 10:51:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-17 10:51:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:51:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-12-17 10:51:05,586 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2021-12-17 10:51:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 10:51:05,587 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-12-17 10:51:05,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:51:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-12-17 10:51:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 10:51:05,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 10:51:05,588 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 10:51:05,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 10:51:05,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:51:05,794 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 10:51:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 10:51:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1035092622, now seen corresponding path program 3 times [2021-12-17 10:51:05,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 10:51:05,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183567905] [2021-12-17 10:51:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 10:51:05,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 10:51:05,822 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 10:51:05,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728669543] [2021-12-17 10:51:05,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 10:51:05,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 10:51:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 10:51:05,833 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) [2021-12-17 10:51:05,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 10:51:06,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-17 10:51:06,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 10:51:06,021 WARN L261 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-17 10:51:06,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 10:51:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:51:06,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 10:51:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 10:51:09,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 10:51:09,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183567905] [2021-12-17 10:51:09,931 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 10:51:09,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728669543] [2021-12-17 10:51:09,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728669543] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 10:51:09,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 10:51:09,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-17 10:51:09,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905985034] [2021-12-17 10:51:09,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 10:51:09,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-17 10:51:09,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 10:51:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-17 10:51:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2021-12-17 10:51:09,933 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 10:51:12,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 15) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296)) (.cse13 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 12) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 9) 4294967296)) (.cse16 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 21) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296)) (.cse12 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse4 (mod (+ c_~SIZE~0 2) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296))) (and (or (<= .cse0 .cse1) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296))) (and (= .cse2 .cse3) (= .cse3 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 9) 4294967296)) (not (= 0 (mod (mod .cse2 .cse4) 4294967296))))) (< .cse2 .cse0)) (or (<= .cse0 .cse5) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296))) (and (= .cse6 .cse7) (= .cse7 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 18) 4294967296)) (not (= 0 (mod (mod .cse6 .cse4) 4294967296))))) (< .cse6 .cse0)) (or (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296))) (and (= .cse8 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 15) 4294967296)) (not (= 0 (mod (mod .cse5 .cse4) 4294967296))) (= .cse5 .cse8))) (<= .cse0 .cse9) (< .cse5 .cse0)) (or (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (= .cse10 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 3) 4294967296)) (= .cse11 .cse10) (not (= 0 (mod (mod .cse11 .cse4) 4294967296))))) (< .cse11 .cse0) (<= .cse0 .cse12)) (or (< .cse13 .cse0) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 27) 4294967296))) (and (= .cse13 .cse14) (= .cse14 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 27) 4294967296)) (not (= 0 (mod (mod .cse13 .cse4) 4294967296))))) (<= .cse0 .cse15)) (or (<= .cse0 .cse16) (< .cse15 .cse0) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 24) 4294967296))) (and (= .cse15 .cse17) (= .cse17 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 24) 4294967296)) (not (= 0 (mod (mod .cse15 .cse4) 4294967296)))))) (= c_~SIZE~0 20000001) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 30) 4294967296))) (or (<= .cse0 .cse13) (< .cse18 .cse0) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 30) 4294967296))) (and (not (= 0 (mod (mod .cse18 .cse4) 4294967296))) (= .cse18 .cse19) (= .cse19 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 30) 4294967296)))))) (or (< .cse9 .cse0) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296))) (and (= .cse20 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 12) 4294967296)) (= .cse9 .cse20) (not (= 0 (mod (mod .cse9 .cse4) 4294967296))))) (<= .cse0 .cse2)) (or (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 21) 4294967296))) (and (= .cse21 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 21) 4294967296)) (not (= 0 (mod (mod .cse16 .cse4) 4294967296))) (= .cse16 .cse21))) (< .cse16 .cse0) (<= .cse0 .cse6)) (or (let ((.cse22 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (and (= .cse22 (mod |c_ULTIMATE.start_main_~k~0#1| 4294967296)) (= .cse12 .cse22) (not (= 0 (mod (mod .cse12 .cse4) 4294967296))))) (<= .cse0 0)) (or (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296))) (and (= .cse1 .cse23) (= .cse23 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 6) 4294967296)) (not (= 0 (mod (mod .cse1 .cse4) 4294967296))))) (< .cse1 .cse0) (<= .cse0 .cse11)))) is different from false [2021-12-17 10:53:22,212 WARN L227 SmtUtils]: Spent 2.03m on a formula simplification that was a NOOP. DAG size: 178 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:53:24,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:53:26,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:53:28,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:53:30,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:53:32,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:54:57,771 WARN L227 SmtUtils]: Spent 1.25m on a formula simplification that was a NOOP. DAG size: 161 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:54:59,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:55:01,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:55:03,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 15) 4294967296)) (.cse15 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296)) (.cse9 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 12) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 9) 4294967296)) (.cse16 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 21) 4294967296)) (.cse6 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296)) (.cse12 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse4 (mod (+ c_~SIZE~0 2) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 6) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse11 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 3) 4294967296))) (and (or (<= .cse0 .cse1) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296))) (and (= .cse2 .cse3) (= .cse3 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 9) 4294967296)) (not (= 0 (mod (mod .cse2 .cse4) 4294967296))))) (< .cse2 .cse0)) (or (<= .cse0 .cse5) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296))) (and (= .cse6 .cse7) (= .cse7 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 18) 4294967296)) (not (= 0 (mod (mod .cse6 .cse4) 4294967296))))) (< .cse6 .cse0)) (or (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296))) (and (= .cse8 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 15) 4294967296)) (not (= 0 (mod (mod .cse5 .cse4) 4294967296))) (= .cse5 .cse8))) (<= .cse0 .cse9) (< .cse5 .cse0)) (or (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (= .cse10 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 3) 4294967296)) (= .cse11 .cse10) (not (= 0 (mod (mod .cse11 .cse4) 4294967296))))) (< .cse11 .cse0) (<= .cse0 .cse12)) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296))) (or (< .cse13 .cse0) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 27) 4294967296))) (and (= .cse13 .cse14) (= .cse14 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 27) 4294967296)) (not (= 0 (mod (mod .cse13 .cse4) 4294967296))))) (<= .cse0 .cse15))) (or (<= .cse0 .cse16) (< .cse15 .cse0) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 24) 4294967296))) (and (= .cse15 .cse17) (= .cse17 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 24) 4294967296)) (not (= 0 (mod (mod .cse15 .cse4) 4294967296)))))) (or (< .cse9 .cse0) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296))) (and (= .cse18 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 12) 4294967296)) (= .cse9 .cse18) (not (= 0 (mod (mod .cse9 .cse4) 4294967296))))) (<= .cse0 .cse2)) (or (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 21) 4294967296))) (and (= .cse19 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 21) 4294967296)) (not (= 0 (mod (mod .cse16 .cse4) 4294967296))) (= .cse16 .cse19))) (< .cse16 .cse0) (<= .cse0 .cse6)) (or (let ((.cse20 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (and (= .cse20 (mod |c_ULTIMATE.start_main_~k~0#1| 4294967296)) (= .cse12 .cse20) (not (= 0 (mod (mod .cse12 .cse4) 4294967296))))) (<= .cse0 0)) (or (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296))) (and (= .cse1 .cse21) (= .cse21 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 6) 4294967296)) (not (= 0 (mod (mod .cse1 .cse4) 4294967296))))) (< .cse1 .cse0) (<= .cse0 .cse11)))) is different from false [2021-12-17 10:55:09,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:55:11,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 10:56:25,449 WARN L227 SmtUtils]: Spent 1.03m on a formula simplification that was a NOOP. DAG size: 144 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 10:56:27,454 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 11:02:03,224 WARN L227 SmtUtils]: Spent 5.38m on a formula simplification. DAG size of input: 160 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:02:06,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 11:03:08,427 WARN L227 SmtUtils]: Spent 44.77s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 11:03:10,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 11:03:11,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 11:03:13,531 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Killed by 15