/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/fermat1-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:15:26,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:15:26,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:15:26,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:15:26,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:15:26,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:15:26,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:15:26,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:15:26,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:15:26,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:15:26,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:15:26,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:15:26,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:15:26,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:15:26,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:15:26,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:15:26,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:15:26,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:15:26,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:15:26,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:15:26,357 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:15:26,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:15:26,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:15:26,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:15:26,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:15:26,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:15:26,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:15:26,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:15:26,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:15:26,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:15:26,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:15:26,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:15:26,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:15:26,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:15:26,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:15:26,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:15:26,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:15:26,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:15:26,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:15:26,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:15:26,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:15:26,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:15:26,376 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-14 16:15:26,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:15:26,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:15:26,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:15:26,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:15:26,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:15:26,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:15:26,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:15:26,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:15:26,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:15:26,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:15:26,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:15:26,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:15:26,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:15:26,399 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:15:26,399 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:15:26,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:15:26,399 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-14 16:15:26,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:15:26,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:15:26,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:15:26,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:15:26,566 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:15:26,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound100.c [2022-04-14 16:15:26,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc90748f/9eba1fdfbca4471f9173ffd84730c36a/FLAGbbc916d1a [2022-04-14 16:15:26,961 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:15:26,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_valuebound100.c [2022-04-14 16:15:26,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc90748f/9eba1fdfbca4471f9173ffd84730c36a/FLAGbbc916d1a [2022-04-14 16:15:26,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc90748f/9eba1fdfbca4471f9173ffd84730c36a [2022-04-14 16:15:26,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:15:26,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:15:26,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:15:26,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:15:26,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:15:26,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:15:26" (1/1) ... [2022-04-14 16:15:26,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9684a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:26, skipping insertion in model container [2022-04-14 16:15:26,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:15:26" (1/1) ... [2022-04-14 16:15:26,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:15:27,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:15:27,152 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/fermat1-ll_valuebound100.c[535,548] [2022-04-14 16:15:27,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:15:27,175 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:15:27,185 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/fermat1-ll_valuebound100.c[535,548] [2022-04-14 16:15:27,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:15:27,202 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:15:27,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27 WrapperNode [2022-04-14 16:15:27,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:15:27,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:15:27,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:15:27,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:15:27,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:15:27,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:15:27,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:15:27,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:15:27,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (1/1) ... [2022-04-14 16:15:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:15:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:27,259 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-14 16:15:27,275 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-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:15:27,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:15:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:15:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:15:27,298 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:15:27,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:15:27,340 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:15:27,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:15:27,482 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:15:27,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:15:27,490 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-14 16:15:27,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:15:27 BoogieIcfgContainer [2022-04-14 16:15:27,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:15:27,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:15:27,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:15:27,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:15:27,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:15:26" (1/3) ... [2022-04-14 16:15:27,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b34300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:15:27, skipping insertion in model container [2022-04-14 16:15:27,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:15:27" (2/3) ... [2022-04-14 16:15:27,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b34300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:15:27, skipping insertion in model container [2022-04-14 16:15:27,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:15:27" (3/3) ... [2022-04-14 16:15:27,500 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound100.c [2022-04-14 16:15:27,503 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:15:27,503 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:15:27,529 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:15:27,533 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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 [2022-04-14 16:15:27,533 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:15:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 16:15:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 16:15:27,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:27,554 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:27,554 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:27,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1718462925, now seen corresponding path program 1 times [2022-04-14 16:15:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883852290] [2022-04-14 16:15:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:15:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(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(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-14 16:15:27,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 16:15:27,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-04-14 16:15:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 16:15:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-14 16:15:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 16:15:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-14 16:15:27,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 16:15:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-14 16:15:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 16:15:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:27,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-14 16:15:27,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {61#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 16:15:27,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#(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(13, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-04-14 16:15:27,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-14 16:15:27,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-04-14 16:15:27,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret6 := main(); {40#true} is VALID [2022-04-14 16:15:27,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {40#true} is VALID [2022-04-14 16:15:27,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {40#true} is VALID [2022-04-14 16:15:27,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,795 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-14 16:15:27,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {41#false} is VALID [2022-04-14 16:15:27,795 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {40#true} is VALID [2022-04-14 16:15:27,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,796 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-14 16:15:27,796 INFO L272 TraceCheckUtils]: 17: Hoare triple {41#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-14 16:15:27,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,798 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41#false} {41#false} #94#return; {41#false} is VALID [2022-04-14 16:15:27,798 INFO L272 TraceCheckUtils]: 22: Hoare triple {41#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-14 16:15:27,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-14 16:15:27,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-14 16:15:27,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41#false} {41#false} #96#return; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L272 TraceCheckUtils]: 29: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-14 16:15:27,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-14 16:15:27,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-14 16:15:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 16:15:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883852290] [2022-04-14 16:15:27,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883852290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:15:27,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:15:27,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 16:15:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367272058] [2022-04-14 16:15:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:15:27,808 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 16:15:27,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:27,811 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:15:27,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:27,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 16:15:27,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 16:15:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:15:27,848 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:15:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:27,946 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2022-04-14 16:15:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 16:15:27,946 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-14 16:15:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:27,947 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:15:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-14 16:15:27,953 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:15:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-04-14 16:15:27,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-04-14 16:15:28,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:28,064 INFO L225 Difference]: With dead ends: 67 [2022-04-14 16:15:28,064 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 16:15:28,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-14 16:15:28,069 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:15:28,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:15:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 16:15:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 16:15:28,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:28,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:15:28,096 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:15:28,097 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:15:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:28,100 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 16:15:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 16:15:28,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:28,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:28,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-04-14 16:15:28,101 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 32 states. [2022-04-14 16:15:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:28,104 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 16:15:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 16:15:28,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:28,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:28,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:28,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 16:15:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-14 16:15:28,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 33 [2022-04-14 16:15:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:28,112 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-14 16:15:28,113 INFO L479 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:15:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 16:15:28,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-14 16:15:28,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:28,113 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:28,114 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 16:15:28,114 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 657160210, now seen corresponding path program 1 times [2022-04-14 16:15:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:28,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870758201] [2022-04-14 16:15:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:28,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:15:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093498395] [2022-04-14 16:15:28,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:28,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:28,146 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-14 16:15:28,147 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-14 16:15:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:28,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:15:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:28,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:34,542 WARN L833 $PredicateComparison]: unable to prove that (or (<= 1 |c___VERIFIER_assert_#in~cond|) (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~u~0_BEFORE_CALL_1_39 Int)) (not (= (+ (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 8) (* (let ((.cse0 (div (+ 2 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 (- 2))) (- 2)))) (* .cse0 .cse0)) 4)) (+ (* 4 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 aux_div_v_main_~u~0_BEFORE_CALL_1_39)) 4)))))) is different from false [2022-04-14 16:15:35,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {270#true} call ULTIMATE.init(); {270#true} is VALID [2022-04-14 16:15:35,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#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(13, 2);call #Ultimate.allocInit(12, 3); {270#true} is VALID [2022-04-14 16:15:35,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-14 16:15:35,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270#true} {270#true} #106#return; {270#true} is VALID [2022-04-14 16:15:35,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {270#true} call #t~ret6 := main(); {270#true} is VALID [2022-04-14 16:15:35,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {270#true} is VALID [2022-04-14 16:15:35,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {270#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {270#true} is VALID [2022-04-14 16:15:35,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-14 16:15:35,909 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {270#true} {270#true} #90#return; {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {270#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {270#true} is VALID [2022-04-14 16:15:35,909 INFO L272 TraceCheckUtils]: 12: Hoare triple {270#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-14 16:15:35,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-14 16:15:35,910 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {270#true} {270#true} #92#return; {270#true} is VALID [2022-04-14 16:15:35,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {270#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {270#true} is VALID [2022-04-14 16:15:35,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-14 16:15:35,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-14 16:15:35,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-14 16:15:35,910 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {270#true} {270#true} #94#return; {270#true} is VALID [2022-04-14 16:15:35,910 INFO L272 TraceCheckUtils]: 22: Hoare triple {270#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {270#true} is VALID [2022-04-14 16:15:35,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {270#true} ~cond := #in~cond; {270#true} is VALID [2022-04-14 16:15:35,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#true} assume !(0 == ~cond); {270#true} is VALID [2022-04-14 16:15:35,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {270#true} assume true; {270#true} is VALID [2022-04-14 16:15:35,911 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {270#true} {270#true} #96#return; {270#true} is VALID [2022-04-14 16:15:37,538 INFO L290 TraceCheckUtils]: 27: Hoare triple {270#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {356#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:15:37,539 INFO L290 TraceCheckUtils]: 28: Hoare triple {356#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !false; {356#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-14 16:15:37,546 INFO L272 TraceCheckUtils]: 29: Hoare triple {356#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {363#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~u~0_BEFORE_CALL_1_39 Int)) (not (= (+ (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 8) (* (* (div (+ 2 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 (- 2))) (- 2)) (div (+ 2 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 (- 2))) (- 2))) 4)) (+ (* 4 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 aux_div_v_main_~u~0_BEFORE_CALL_1_39)) 4))))))} is VALID [2022-04-14 16:15:39,548 WARN L290 TraceCheckUtils]: 30: Hoare triple {363#(or (<= 1 |__VERIFIER_assert_#in~cond|) (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~u~0_BEFORE_CALL_1_39 Int)) (not (= (+ (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 8) (* (* (div (+ 2 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 (- 2))) (- 2)) (div (+ 2 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 (- 2))) (- 2))) 4)) (+ (* 4 (* aux_div_v_main_~u~0_BEFORE_CALL_1_39 aux_div_v_main_~u~0_BEFORE_CALL_1_39)) 4))))))} ~cond := #in~cond; {367#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-14 16:15:39,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {271#false} is VALID [2022-04-14 16:15:39,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {271#false} assume !false; {271#false} is VALID [2022-04-14 16:15:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 16:15:39,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:15:39,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870758201] [2022-04-14 16:15:39,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:39,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093498395] [2022-04-14 16:15:39,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093498395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:15:39,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:15:39,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:15:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369249630] [2022-04-14 16:15:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:15:39,552 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-14 16:15:39,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:39,552 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:15:43,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 22 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:43,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:15:43,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:15:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2022-04-14 16:15:43,599 INFO L87 Difference]: Start difference. First operand 32 states and 40 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:15:44,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:15:46,981 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 [] [2022-04-14 16:15:48,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:15:52,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:15:55,933 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 [] [2022-04-14 16:15:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:55,961 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-14 16:15:55,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:15:55,961 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-14 16:15:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:55,961 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:15:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-14 16:15:55,963 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:15:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-14 16:15:55,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-14 16:15:57,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:57,868 INFO L225 Difference]: With dead ends: 48 [2022-04-14 16:15:57,868 INFO L226 Difference]: Without dead ends: 46 [2022-04-14 16:15:57,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2022-04-14 16:15:57,870 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:15:57,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 19 Unchecked, 8.6s Time] [2022-04-14 16:15:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-14 16:15:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-14 16:15:57,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:57,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:15:57,884 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:15:57,886 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:15:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:57,891 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-14 16:15:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-14 16:15:57,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:57,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:57,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-14 16:15:57,893 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-14 16:15:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:57,897 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-14 16:15:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-14 16:15:57,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:57,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:57,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:57,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:15:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2022-04-14 16:15:57,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 33 [2022-04-14 16:15:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:57,900 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2022-04-14 16:15:57,901 INFO L479 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-14 16:15:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-14 16:15:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 16:15:57,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:15:57,902 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:15:57,908 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-14 16:15:58,108 WARN L460 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-14 16:15:58,108 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:15:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:15:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 936002262, now seen corresponding path program 1 times [2022-04-14 16:15:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:15:58,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236717512] [2022-04-14 16:15:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:15:58,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:15:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387039858] [2022-04-14 16:15:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:15:58,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:15:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:15:58,142 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-14 16:15:58,142 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-14 16:15:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:58,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:15:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:15:58,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:58,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2022-04-14 16:15:58,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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(13, 2);call #Ultimate.allocInit(12, 3); {603#true} is VALID [2022-04-14 16:15:58,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #106#return; {603#true} is VALID [2022-04-14 16:15:58,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret6 := main(); {603#true} is VALID [2022-04-14 16:15:58,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {603#true} is VALID [2022-04-14 16:15:58,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {603#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {603#true} {603#true} #90#return; {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {603#true} is VALID [2022-04-14 16:15:58,381 INFO L272 TraceCheckUtils]: 12: Hoare triple {603#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {603#true} {603#true} #92#return; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {603#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L272 TraceCheckUtils]: 22: Hoare triple {603#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,385 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {603#true} {603#true} #96#return; {603#true} is VALID [2022-04-14 16:15:58,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {603#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {603#true} is VALID [2022-04-14 16:15:58,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {603#true} assume !false; {603#true} is VALID [2022-04-14 16:15:58,386 INFO L272 TraceCheckUtils]: 29: Hoare triple {603#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {603#true} ~cond := #in~cond; {698#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:15:58,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {698#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:58,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:58,390 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} {603#true} #98#return; {709#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-14 16:15:58,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {709#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {713#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:15:58,396 INFO L272 TraceCheckUtils]: 35: Hoare triple {713#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:15:58,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:15:58,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {604#false} is VALID [2022-04-14 16:15:58,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-04-14 16:15:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 16:15:58,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:15:58,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-04-14 16:15:58,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {604#false} is VALID [2022-04-14 16:15:58,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:15:58,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {713#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:15:58,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {740#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {713#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-14 16:15:58,769 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} {603#true} #98#return; {740#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-14 16:15:58,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {702#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:58,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {753#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {603#true} ~cond := #in~cond; {753#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:15:58,770 INFO L272 TraceCheckUtils]: 29: Hoare triple {603#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {603#true} assume !false; {603#true} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {603#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {603#true} is VALID [2022-04-14 16:15:58,770 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {603#true} {603#true} #96#return; {603#true} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L272 TraceCheckUtils]: 22: Hoare triple {603#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,771 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {603#true} {603#true} #94#return; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {603#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {603#true} {603#true} #92#return; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {603#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {603#true} {603#true} #90#return; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#true} assume !(0 == ~cond); {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#true} ~cond := #in~cond; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {603#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {603#true} is VALID [2022-04-14 16:15:58,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {603#true} is VALID [2022-04-14 16:15:58,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} call #t~ret6 := main(); {603#true} is VALID [2022-04-14 16:15:58,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} #106#return; {603#true} is VALID [2022-04-14 16:15:58,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} assume true; {603#true} is VALID [2022-04-14 16:15:58,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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(13, 2);call #Ultimate.allocInit(12, 3); {603#true} is VALID [2022-04-14 16:15:58,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} call ULTIMATE.init(); {603#true} is VALID [2022-04-14 16:15:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-14 16:15:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:58,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236717512] [2022-04-14 16:15:58,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:58,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387039858] [2022-04-14 16:15:58,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387039858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:15:58,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:15:58,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 16:15:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391897116] [2022-04-14 16:15:58,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:15:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-14 16:15:58,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:58,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 16:15:58,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:58,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:15:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:15:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:15:58,796 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 16:15:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:59,231 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-14 16:15:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:15:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 39 [2022-04-14 16:15:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:15:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 16:15:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 16:15:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 16:15:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 16:15:59,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 16:15:59,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:59,269 INFO L225 Difference]: With dead ends: 45 [2022-04-14 16:15:59,269 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 16:15:59,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-14 16:15:59,270 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:15:59,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:15:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 16:15:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 16:15:59,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:15:59,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-14 16:15:59,271 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-14 16:15:59,271 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-14 16:15:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:59,271 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 16:15:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 16:15:59,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:59,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:59,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-14 16:15:59,272 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-14 16:15:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:15:59,272 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 16:15:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 16:15:59,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:59,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:15:59,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:15:59,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:15:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-14 16:15:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 16:15:59,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-14 16:15:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:15:59,273 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 16:15:59,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 16:15:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 16:15:59,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:15:59,275 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 16:15:59,292 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-14 16:15:59,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 16:15:59,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 16:15:59,557 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-14 16:15:59,559 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-14 16:15:59,559 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-14 16:15:59,561 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-14 16:15:59,561 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-14 16:15:59,561 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-14 16:15:59,561 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 55) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 59) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L48-1(lines 35 55) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 35 55) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 46) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L36-1(lines 35 55) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-14 16:15:59,562 INFO L882 garLoopResultBuilder]: For program point L49-1(lines 48 54) no Hoare annotation was computed. [2022-04-14 16:15:59,562 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-14 16:15:59,563 INFO L882 garLoopResultBuilder]: For program point L41-1(lines 40 46) no Hoare annotation was computed. [2022-04-14 16:15:59,563 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-14 16:15:59,563 INFO L885 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-14 16:15:59,563 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 59) no Hoare annotation was computed. [2022-04-14 16:15:59,563 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 59) the Hoare annotation is: true [2022-04-14 16:15:59,563 INFO L885 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-04-14 16:15:59,563 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 16:15:59,563 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 16:15:59,563 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 16:15:59,564 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-14 16:15:59,564 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-14 16:15:59,566 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 16:15:59,568 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 16:15:59,572 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 16:15:59,573 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 16:15:59,573 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 16:15:59,573 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:15:59,573 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 16:15:59,578 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:15:59,579 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-14 16:15:59,580 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-14 16:15:59,582 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-14 16:15:59,582 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-14 16:15:59,583 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 16:15:59,583 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 16:15:59,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:15:59 BoogieIcfgContainer [2022-04-14 16:15:59,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 16:15:59,598 INFO L158 Benchmark]: Toolchain (without parser) took 32621.35ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 138.5MB in the beginning and 197.8MB in the end (delta: -59.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 16:15:59,598 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 186.6MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 16:15:59,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.36ms. Allocated memory is still 186.6MB. Free memory was 138.3MB in the beginning and 162.7MB in the end (delta: -24.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-14 16:15:59,599 INFO L158 Benchmark]: Boogie Preprocessor took 27.65ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 161.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 16:15:59,599 INFO L158 Benchmark]: RCFGBuilder took 259.15ms. Allocated memory is still 186.6MB. Free memory was 160.6MB in the beginning and 148.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 16:15:59,599 INFO L158 Benchmark]: TraceAbstraction took 32104.73ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 148.0MB in the beginning and 197.8MB in the end (delta: -49.7MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-14 16:15:59,600 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.08ms. Allocated memory is still 186.6MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.36ms. Allocated memory is still 186.6MB. Free memory was 138.3MB in the beginning and 162.7MB in the end (delta: -24.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.65ms. Allocated memory is still 186.6MB. Free memory was 162.7MB in the beginning and 161.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.15ms. Allocated memory is still 186.6MB. Free memory was 160.6MB in the beginning and 148.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32104.73ms. Allocated memory was 186.6MB in the beginning and 243.3MB in the end (delta: 56.6MB). Free memory was 148.0MB in the beginning and 197.8MB in the end (delta: -49.7MB). Peak memory consumption was 7.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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.0s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 99 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 32 PreInvPairs, 46 NumberOfFragments, 161 HoareAnnotationTreeSize, 32 FomulaSimplifications, 39 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 270 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 140 ConstructedInterpolants, 1 QuantifiedInterpolants, 353 SizeOfPredicates, 9 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 RESULT: Ultimate proved your program to be correct! [2022-04-14 16:15:59,619 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...