/usr/bin/java -ea -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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:21:08,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:21:08,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:21:08,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:21:08,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:21:08,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:21:08,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:21:08,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:21:08,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:21:08,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:21:08,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:21:08,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:21:08,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:21:08,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:21:08,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:21:08,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:21:08,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:21:08,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:21:08,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:21:08,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:21:08,497 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:21:08,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:21:08,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:21:08,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:21:08,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:21:08,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:21:08,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:21:08,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:21:08,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:21:08,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:21:08,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:21:08,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:21:08,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:21:08,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:21:08,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:21:08,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:21:08,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:21:08,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:21:08,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:21:08,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:21:08,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:21:08,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:21:08,518 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:21:08,538 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:21:08,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:21:08,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:21:08,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:21:08,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:21:08,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:21:08,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:21:08,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:21:08,540 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:21:08,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:21:08,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:21:08,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:21:08,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:21:08,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:08,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:21:08,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:21:08,543 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-04-27 13:21:08,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:21:08,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:21:08,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:21:08,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:21:08,740 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:21:08,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound1.c [2022-04-27 13:21:08,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41879be95/7a7627394d374fe0a124a512e852057e/FLAGfda92321a [2022-04-27 13:21:09,134 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:21:09,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound1.c [2022-04-27 13:21:09,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41879be95/7a7627394d374fe0a124a512e852057e/FLAGfda92321a [2022-04-27 13:21:09,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41879be95/7a7627394d374fe0a124a512e852057e [2022-04-27 13:21:09,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:21:09,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:21:09,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:09,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:21:09,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:21:09,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5634a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09, skipping insertion in model container [2022-04-27 13:21:09,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:21:09,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:21:09,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound1.c[555,568] [2022-04-27 13:21:09,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:09,360 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:21:09,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound1.c[555,568] [2022-04-27 13:21:09,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:21:09,395 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:21:09,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09 WrapperNode [2022-04-27 13:21:09,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:21:09,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:21:09,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:21:09,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:21:09,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:21:09,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:21:09,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:21:09,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:21:09,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (1/1) ... [2022-04-27 13:21:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:21:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:09,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:21:09,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:21:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:21:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:21:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:21:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:21:09,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:21:09,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:21:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:21:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:21:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:21:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:21:09,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:21:09,549 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:21:09,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:21:09,668 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:21:09,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:21:09,672 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:21:09,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:09 BoogieIcfgContainer [2022-04-27 13:21:09,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:21:09,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:21:09,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:21:09,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:21:09,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:21:09" (1/3) ... [2022-04-27 13:21:09,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c9ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:09, skipping insertion in model container [2022-04-27 13:21:09,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:21:09" (2/3) ... [2022-04-27 13:21:09,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c9ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:21:09, skipping insertion in model container [2022-04-27 13:21:09,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:21:09" (3/3) ... [2022-04-27 13:21:09,678 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound1.c [2022-04-27 13:21:09,687 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:21:09,687 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:21:09,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:21:09,736 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46eed8ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@115dcf7e [2022-04-27 13:21:09,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:21:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:21:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:21:09,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:09,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:09,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1335806002, now seen corresponding path program 1 times [2022-04-27 13:21:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:09,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926245521] [2022-04-27 13:21:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:09,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:21:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:09,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-27 13:21:09,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:21:09,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-27 13:21:09,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:21:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:09,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:21:09,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:21:09,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:21:09,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-27 13:21:09,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:21:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:09,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:21:09,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:21:09,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:21:09,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-27 13:21:09,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:21:09,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {33#true} is VALID [2022-04-27 13:21:09,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:21:09,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #62#return; {33#true} is VALID [2022-04-27 13:21:09,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret6 := main(); {33#true} is VALID [2022-04-27 13:21:09,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4; {33#true} is VALID [2022-04-27 13:21:09,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 1 then 1 else 0)); {33#true} is VALID [2022-04-27 13:21:09,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:21:09,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:21:09,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:21:09,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #54#return; {34#false} is VALID [2022-04-27 13:21:09,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~k~0 := #t~nondet5;havoc #t~nondet5; {34#false} is VALID [2022-04-27 13:21:09,968 INFO L272 TraceCheckUtils]: 12: Hoare triple {34#false} call assume_abort_if_not((if ~k~0 % 4294967296 >= 0 && ~k~0 % 4294967296 <= 1 then 1 else 0)); {33#true} is VALID [2022-04-27 13:21:09,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:21:09,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:21:09,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:21:09,969 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34#false} {34#false} #56#return; {34#false} is VALID [2022-04-27 13:21:09,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} ~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {34#false} is VALID [2022-04-27 13:21:09,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:21:09,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {34#false} is VALID [2022-04-27 13:21:09,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:21:09,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 13:21:09,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:21:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:21:09,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:09,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926245521] [2022-04-27 13:21:09,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926245521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:21:09,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:21:09,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:21:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436824764] [2022-04-27 13:21:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:21:09,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:09,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:10,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:10,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:21:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:10,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:21:10,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:10,030 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:10,135 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-27 13:21:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:21:10,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:21:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-27 13:21:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-27 13:21:10,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-27 13:21:10,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:10,257 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:21:10,257 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:21:10,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:21:10,261 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:10,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:21:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:21:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:21:10,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:10,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:10,281 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:10,281 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:10,284 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:10,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:10,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:10,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:21:10,285 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:21:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:10,288 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 13:21:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:10,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:10,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:10,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:10,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 13:21:10,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-04-27 13:21:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:10,291 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 13:21:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:21:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 13:21:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:21:10,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:10,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:10,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:21:10,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:10,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:10,293 INFO L85 PathProgramCache]: Analyzing trace with hash 736000694, now seen corresponding path program 1 times [2022-04-27 13:21:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:10,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696442018] [2022-04-27 13:21:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:10,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:10,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482233006] [2022-04-27 13:21:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:10,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:21:10,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:21:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:10,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:21:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:21:10,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:21:10,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2022-04-27 13:21:10,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-27 13:21:10,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-27 13:21:10,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #62#return; {205#true} is VALID [2022-04-27 13:21:10,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret6 := main(); {205#true} is VALID [2022-04-27 13:21:10,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4; {205#true} is VALID [2022-04-27 13:21:10,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {205#true} call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 1 then 1 else 0)); {205#true} is VALID [2022-04-27 13:21:10,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#true} ~cond := #in~cond; {231#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:21:10,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {235#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:21:10,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {235#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:21:10,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(not (= |assume_abort_if_not_#in~cond| 0))} {205#true} #54#return; {242#(<= (mod main_~z~0 4294967296) 1)} is VALID [2022-04-27 13:21:10,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#(<= (mod main_~z~0 4294967296) 1)} ~k~0 := #t~nondet5;havoc #t~nondet5; {242#(<= (mod main_~z~0 4294967296) 1)} is VALID [2022-04-27 13:21:10,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {242#(<= (mod main_~z~0 4294967296) 1)} call assume_abort_if_not((if ~k~0 % 4294967296 >= 0 && ~k~0 % 4294967296 <= 1 then 1 else 0)); {205#true} is VALID [2022-04-27 13:21:10,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {205#true} ~cond := #in~cond; {205#true} is VALID [2022-04-27 13:21:10,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {205#true} assume !(0 == ~cond); {205#true} is VALID [2022-04-27 13:21:10,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-27 13:21:10,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {205#true} {242#(<= (mod main_~z~0 4294967296) 1)} #56#return; {242#(<= (mod main_~z~0 4294967296) 1)} is VALID [2022-04-27 13:21:10,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {242#(<= (mod main_~z~0 4294967296) 1)} ~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {264#(and (<= (mod main_~z~0 4294967296) 1) (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:21:10,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {264#(and (<= (mod main_~z~0 4294967296) 1) (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !false; {264#(and (<= (mod main_~z~0 4294967296) 1) (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-27 13:21:10,740 INFO L272 TraceCheckUtils]: 19: Hoare triple {264#(and (<= (mod main_~z~0 4294967296) 1) (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:10,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:10,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {206#false} is VALID [2022-04-27 13:21:10,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-04-27 13:21:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:21:10,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:21:11,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-04-27 13:21:11,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {206#false} is VALID [2022-04-27 13:21:11,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:21:11,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {291#(= (+ (* (mod main_~z~0 4294967296) main_~x~0) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:21:11,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {291#(= (+ (* (mod main_~z~0 4294967296) main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !false; {291#(= (+ (* (mod main_~z~0 4294967296) main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:11,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {205#true} ~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {291#(= (+ (* (mod main_~z~0 4294967296) main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 13:21:11,060 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {205#true} {205#true} #56#return; {205#true} is VALID [2022-04-27 13:21:11,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-27 13:21:11,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {205#true} assume !(0 == ~cond); {205#true} is VALID [2022-04-27 13:21:11,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {205#true} ~cond := #in~cond; {205#true} is VALID [2022-04-27 13:21:11,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {205#true} call assume_abort_if_not((if ~k~0 % 4294967296 >= 0 && ~k~0 % 4294967296 <= 1 then 1 else 0)); {205#true} is VALID [2022-04-27 13:21:11,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#true} ~k~0 := #t~nondet5;havoc #t~nondet5; {205#true} is VALID [2022-04-27 13:21:11,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {205#true} {205#true} #54#return; {205#true} is VALID [2022-04-27 13:21:11,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-27 13:21:11,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#true} assume !(0 == ~cond); {205#true} is VALID [2022-04-27 13:21:11,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#true} ~cond := #in~cond; {205#true} is VALID [2022-04-27 13:21:11,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {205#true} call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 1 then 1 else 0)); {205#true} is VALID [2022-04-27 13:21:11,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4; {205#true} is VALID [2022-04-27 13:21:11,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret6 := main(); {205#true} is VALID [2022-04-27 13:21:11,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #62#return; {205#true} is VALID [2022-04-27 13:21:11,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-27 13:21:11,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-27 13:21:11,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2022-04-27 13:21:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:21:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:21:11,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696442018] [2022-04-27 13:21:11,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:21:11,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482233006] [2022-04-27 13:21:11,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482233006] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:21:11,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:21:11,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 13:21:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289971101] [2022-04-27 13:21:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:21:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:21:11,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:21:11,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:11,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:11,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:21:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:21:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:21:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:21:11,081 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:11,710 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 13:21:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:21:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:21:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:21:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 13:21:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 13:21:11,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 13:21:11,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:21:11,740 INFO L225 Difference]: With dead ends: 31 [2022-04-27 13:21:11,740 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:21:11,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:21:11,741 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:21:11,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:21:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:21:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:21:11,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:21:11,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:11,748 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:11,748 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:11,750 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 13:21:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 13:21:11,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:11,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:11,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:21:11,751 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:21:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:21:11,752 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 13:21:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 13:21:11,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:21:11,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:21:11,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:21:11,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:21:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:21:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-27 13:21:11,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2022-04-27 13:21:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:21:11,755 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-27 13:21:11,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:21:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 13:21:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:21:11,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:21:11,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:21:11,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:21:11,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:11,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:21:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:21:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1598096837, now seen corresponding path program 1 times [2022-04-27 13:21:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:21:11,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297311408] [2022-04-27 13:21:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:21:11,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:21:11,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [613474191] [2022-04-27 13:21:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:21:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:21:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:21:11,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:21:11,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:21:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:21:12,026 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:21:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:21:12,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:21:12,045 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:21:12,046 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:21:12,077 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-04-27 13:21:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 13:21:12,262 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 13:21:12,264 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:21:12,277 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:12,278 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:21:12,279 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:21:12,279 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:21:12,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:21:12 BoogieIcfgContainer [2022-04-27 13:21:12,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:21:12,280 INFO L158 Benchmark]: Toolchain (without parser) took 3128.14ms. Allocated memory was 195.0MB in the beginning and 273.7MB in the end (delta: 78.6MB). Free memory was 143.6MB in the beginning and 176.4MB in the end (delta: -32.8MB). Peak memory consumption was 46.9MB. Max. memory is 8.0GB. [2022-04-27 13:21:12,281 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 195.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:21:12,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.59ms. Allocated memory is still 195.0MB. Free memory was 143.3MB in the beginning and 168.9MB in the end (delta: -25.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 13:21:12,281 INFO L158 Benchmark]: Boogie Preprocessor took 31.43ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 167.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 13:21:12,281 INFO L158 Benchmark]: RCFGBuilder took 244.94ms. Allocated memory is still 195.0MB. Free memory was 167.5MB in the beginning and 156.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:21:12,282 INFO L158 Benchmark]: TraceAbstraction took 2605.61ms. Allocated memory was 195.0MB in the beginning and 273.7MB in the end (delta: 78.6MB). Free memory was 155.7MB in the beginning and 176.4MB in the end (delta: -20.8MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. [2022-04-27 13:21:12,283 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 195.0MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.59ms. Allocated memory is still 195.0MB. Free memory was 143.3MB in the beginning and 168.9MB in the end (delta: -25.6MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.43ms. Allocated memory is still 195.0MB. Free memory was 168.9MB in the beginning and 167.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.94ms. Allocated memory is still 195.0MB. Free memory was 167.5MB in the beginning and 156.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2605.61ms. Allocated memory was 195.0MB in the beginning and 273.7MB in the end (delta: 78.6MB). Free memory was 155.7MB in the beginning and 176.4MB in the end (delta: -20.8MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] unsigned int z, k; [L24] long long x, y, c; [L25] z = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(z>=0 && z<=1) VAL [\old(cond)=1] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L26] RET assume_abort_if_not(z>=0 && z<=1) VAL [z=0] [L27] k = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(k>=0 && k<=1) VAL [\old(cond)=1] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(k>=0 && k<=1) VAL [k=1, z=0] [L30] x = 1 [L31] y = z [L32] c = 1 VAL [c=1, k=1, x=1, y=0, z=0] [L34] COND TRUE 1 VAL [c=1, k=1, x=1, y=0, z=0] [L35] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L35] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, k=1, x=1, y=0, z=0] [L37] COND TRUE !(c < k) VAL [c=1, k=1, x=1, y=0, z=0] [L46] x = x * (z - 1) VAL [c=1, k=1, x=4294967295, y=0, z=0] [L48] CALL __VERIFIER_assert(1 + x - y == 0) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 50 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 2 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 9/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:21:12,296 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 0 Received shutdown request...