/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 02:50:20,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 02:50:20,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 02:50:20,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 02:50:20,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 02:50:20,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 02:50:20,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 02:50:20,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 02:50:20,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 02:50:20,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 02:50:20,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 02:50:20,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 02:50:20,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 02:50:20,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 02:50:20,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 02:50:20,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 02:50:20,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 02:50:20,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 02:50:20,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 02:50:20,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 02:50:20,794 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 02:50:20,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 02:50:20,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 02:50:20,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 02:50:20,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 02:50:20,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 02:50:20,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 02:50:20,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 02:50:20,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 02:50:20,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 02:50:20,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 02:50:20,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 02:50:20,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 02:50:20,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 02:50:20,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 02:50:20,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 02:50:20,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 02:50:20,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 02:50:20,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 02:50:20,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 02:50:20,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 02:50:20,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 02:50:20,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 02:50:20,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 02:50:20,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 02:50:20,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 02:50:20,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 02:50:20,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 02:50:20,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 02:50:20,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 02:50:20,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 02:50:20,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 02:50:20,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:50:20,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 02:50:20,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 02:50:20,861 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 02:50:20,861 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-03-19 02:50:21,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 02:50:21,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 02:50:21,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 02:50:21,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 02:50:21,108 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 02:50:21,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-03-19 02:50:21,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7d952b5/efa76562bb4c4df8befe5d20611d7a66/FLAG8ef185310 [2022-03-19 02:50:21,582 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 02:50:21,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-03-19 02:50:21,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7d952b5/efa76562bb4c4df8befe5d20611d7a66/FLAG8ef185310 [2022-03-19 02:50:21,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d7d952b5/efa76562bb4c4df8befe5d20611d7a66 [2022-03-19 02:50:22,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 02:50:22,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 02:50:22,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 02:50:22,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 02:50:22,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 02:50:22,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba1c6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22, skipping insertion in model container [2022-03-19 02:50:22,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 02:50:22,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 02:50:22,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-03-19 02:50:22,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:50:22,228 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 02:50:22,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-03-19 02:50:22,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:50:22,273 INFO L208 MainTranslator]: Completed translation [2022-03-19 02:50:22,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22 WrapperNode [2022-03-19 02:50:22,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 02:50:22,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 02:50:22,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 02:50:22,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 02:50:22,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 02:50:22,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 02:50:22,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 02:50:22,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 02:50:22,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (1/1) ... [2022-03-19 02:50:22,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:50:22,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:50:22,338 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-03-19 02:50:22,345 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-03-19 02:50:22,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 02:50:22,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 02:50:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 02:50:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 02:50:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 02:50:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 02:50:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 02:50:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 02:50:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 02:50:22,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 02:50:22,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 02:50:22,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 02:50:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 02:50:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 02:50:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 02:50:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 02:50:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 02:50:22,448 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 02:50:22,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 02:50:31,269 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 02:50:31,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 02:50:31,273 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 02:50:31,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:50:31 BoogieIcfgContainer [2022-03-19 02:50:31,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 02:50:31,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 02:50:31,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 02:50:31,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 02:50:31,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 02:50:22" (1/3) ... [2022-03-19 02:50:31,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d92fd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:50:31, skipping insertion in model container [2022-03-19 02:50:31,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:50:22" (2/3) ... [2022-03-19 02:50:31,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d92fd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:50:31, skipping insertion in model container [2022-03-19 02:50:31,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:50:31" (3/3) ... [2022-03-19 02:50:31,281 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+sep-reducer.c [2022-03-19 02:50:31,284 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 02:50:31,284 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 02:50:31,314 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 02:50:31,318 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-03-19 02:50:31,319 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 02:50:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-19 02:50:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 02:50:31,337 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:50:31,337 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:50:31,338 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 02:50:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:50:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1267928218, now seen corresponding path program 1 times [2022-03-19 02:50:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:50:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090045775] [2022-03-19 02:50:31,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:50:31,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1267928218, now seen corresponding path program 2 times [2022-03-19 02:50:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:50:31,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17702436] [2022-03-19 02:50:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:50:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:50:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:50:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:50:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:50:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:50:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:50:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17702436] [2022-03-19 02:50:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17702436] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:50:31,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:50:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:50:31,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:50:31,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090045775] [2022-03-19 02:50:31,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090045775] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:50:31,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:50:31,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:50:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226247841] [2022-03-19 02:50:31,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:50:31,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:50:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:50:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:50:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:50:31,963 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:50:34,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:36,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:38,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:40,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:42,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:44,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:47,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:49,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:51,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:53,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:50:54,014 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2022-03-19 02:50:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:50:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-19 02:50:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:50:54,022 INFO L225 Difference]: With dead ends: 85 [2022-03-19 02:50:54,022 INFO L226 Difference]: Without dead ends: 45 [2022-03-19 02:50:54,025 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:50:54,027 INFO L912 BasicCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2022-03-19 02:50:54,027 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 9 Unknown, 0 Unchecked, 21.9s Time] [2022-03-19 02:50:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-19 02:50:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2022-03-19 02:50:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:50:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-03-19 02:50:54,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-03-19 02:50:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:50:54,059 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-03-19 02:50:54,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:50:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-03-19 02:50:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:50:54,061 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:50:54,061 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:50:54,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 02:50:54,061 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 02:50:54,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:50:54,062 INFO L85 PathProgramCache]: Analyzing trace with hash -900894010, now seen corresponding path program 1 times [2022-03-19 02:50:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:50:54,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [897867767] [2022-03-19 02:50:54,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:50:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -900894010, now seen corresponding path program 2 times [2022-03-19 02:50:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:50:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148767603] [2022-03-19 02:50:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:50:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:50:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:50:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:50:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:50:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:50:54,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:50:54,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148767603] [2022-03-19 02:50:54,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148767603] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:50:54,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:50:54,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:50:54,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:50:54,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [897867767] [2022-03-19 02:50:54,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [897867767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:50:54,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:50:54,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:50:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871770943] [2022-03-19 02:50:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:50:54,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:50:54,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:50:54,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:50:54,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:50:54,372 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:50:56,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:50:58,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:00,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:02,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:05,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:07,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:09,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:11,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:13,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:15,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:18,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:21,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:51:21,535 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-03-19 02:51:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:51:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-19 02:51:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:51:21,536 INFO L225 Difference]: With dead ends: 60 [2022-03-19 02:51:21,536 INFO L226 Difference]: Without dead ends: 40 [2022-03-19 02:51:21,536 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:51:21,537 INFO L912 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-03-19 02:51:21,538 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 26.9s Time] [2022-03-19 02:51:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-19 02:51:21,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-03-19 02:51:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-03-19 02:51:21,544 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-03-19 02:51:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:51:21,544 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-03-19 02:51:21,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-03-19 02:51:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 02:51:21,545 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:51:21,545 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:51:21,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 02:51:21,546 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 02:51:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:51:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589807, now seen corresponding path program 1 times [2022-03-19 02:51:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:51:21,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [607392749] [2022-03-19 02:51:21,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:51:21,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2097589807, now seen corresponding path program 2 times [2022-03-19 02:51:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:51:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697788018] [2022-03-19 02:51:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:51:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:51:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:51:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:51:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:51:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-19 02:51:21,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:51:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697788018] [2022-03-19 02:51:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697788018] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:51:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:51:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:51:21,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:51:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [607392749] [2022-03-19 02:51:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [607392749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:51:21,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:51:21,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:51:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205071001] [2022-03-19 02:51:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:51:21,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:51:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:51:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:51:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:51:21,723 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:23,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:25,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:28,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:30,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:32,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:34,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:36,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:39,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:41,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:43,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:45,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:47,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:49,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:52,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:51:52,339 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-03-19 02:51:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 02:51:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-19 02:51:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:51:52,340 INFO L225 Difference]: With dead ends: 65 [2022-03-19 02:51:52,340 INFO L226 Difference]: Without dead ends: 45 [2022-03-19 02:51:52,341 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:51:52,341 INFO L912 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-03-19 02:51:52,342 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 14 Unknown, 0 Unchecked, 30.6s Time] [2022-03-19 02:51:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-19 02:51:52,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-03-19 02:51:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:52,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-03-19 02:51:52,348 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-03-19 02:51:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:51:52,348 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-03-19 02:51:52,348 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-03-19 02:51:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:51:52,349 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:51:52,349 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:51:52,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 02:51:52,349 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 02:51:52,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:51:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -951188527, now seen corresponding path program 1 times [2022-03-19 02:51:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:51:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291721883] [2022-03-19 02:51:52,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:51:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash -951188527, now seen corresponding path program 2 times [2022-03-19 02:51:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:51:52,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248130809] [2022-03-19 02:51:52,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:51:52,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:51:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:51:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:51:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:51:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-19 02:51:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:51:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248130809] [2022-03-19 02:51:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248130809] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:51:52,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:51:52,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:51:52,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:51:52,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291721883] [2022-03-19 02:51:52,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291721883] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:51:52,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:51:52,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:51:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001310670] [2022-03-19 02:51:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:51:52,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:51:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:51:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:51:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:51:52,485 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:51:54,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:56,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:51:58,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:52:01,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:52:03,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:52:05,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:52:07,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-19 02:52:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:52:07,907 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-03-19 02:52:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 02:52:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-19 02:52:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:52:07,907 INFO L225 Difference]: With dead ends: 60 [2022-03-19 02:52:07,908 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 02:52:07,908 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:52:07,909 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-03-19 02:52:07,909 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 15.4s Time] [2022-03-19 02:52:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 02:52:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 02:52:07,909 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-03-19 02:52:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 02:52:07,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-03-19 02:52:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:52:07,910 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 02:52:07,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 02:52:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 02:52:07,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 02:52:07,912 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 02:52:07,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 02:52:07,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 02:52:07,999 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-19 02:52:07,999 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-19 02:52:07,999 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-19 02:52:08,000 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-03-19 02:52:08,000 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 147) the Hoare annotation is: true [2022-03-19 02:52:08,000 INFO L878 garLoopResultBuilder]: At program point L56(lines 56 83) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,000 INFO L878 garLoopResultBuilder]: At program point L52(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,000 INFO L885 garLoopResultBuilder]: At program point L135(lines 35 140) the Hoare annotation is: true [2022-03-19 02:52:08,001 INFO L878 garLoopResultBuilder]: At program point L61(lines 36 112) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,001 INFO L885 garLoopResultBuilder]: At program point L123(lines 35 140) the Hoare annotation is: true [2022-03-19 02:52:08,001 INFO L885 garLoopResultBuilder]: At program point L24(lines 24 141) the Hoare annotation is: true [2022-03-19 02:52:08,001 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 111) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,001 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 104) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296))))))) [2022-03-19 02:52:08,001 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 147) the Hoare annotation is: true [2022-03-19 02:52:08,001 INFO L878 garLoopResultBuilder]: At program point L42(lines 24 141) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,002 INFO L885 garLoopResultBuilder]: At program point L67(lines 67 82) the Hoare annotation is: true [2022-03-19 02:52:08,002 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-03-19 02:52:08,002 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 147) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0)) [2022-03-19 02:52:08,002 INFO L878 garLoopResultBuilder]: At program point L88(lines 88 110) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,002 INFO L885 garLoopResultBuilder]: At program point L22(lines 22 146) the Hoare annotation is: true [2022-03-19 02:52:08,002 INFO L885 garLoopResultBuilder]: At program point L117(lines 117 139) the Hoare annotation is: true [2022-03-19 02:52:08,002 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 84) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point L138(lines 16 147) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point L35(lines 35 140) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,003 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:52:08,006 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-03-19 02:52:08,007 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 02:52:08,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 02:52:08 BoogieIcfgContainer [2022-03-19 02:52:08,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 02:52:08,018 INFO L158 Benchmark]: Toolchain (without parser) took 106016.24ms. Allocated memory was 181.4MB in the beginning and 240.1MB in the end (delta: 58.7MB). Free memory was 126.9MB in the beginning and 107.7MB in the end (delta: 19.2MB). Peak memory consumption was 78.8MB. Max. memory is 8.0GB. [2022-03-19 02:52:08,019 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 02:52:08,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.32ms. Allocated memory was 181.4MB in the beginning and 240.1MB in the end (delta: 58.7MB). Free memory was 126.7MB in the beginning and 211.1MB in the end (delta: -84.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-03-19 02:52:08,019 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 240.1MB. Free memory was 211.1MB in the beginning and 210.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-19 02:52:08,020 INFO L158 Benchmark]: RCFGBuilder took 8959.89ms. Allocated memory is still 240.1MB. Free memory was 210.1MB in the beginning and 197.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-19 02:52:08,020 INFO L158 Benchmark]: TraceAbstraction took 96741.92ms. Allocated memory is still 240.1MB. Free memory was 196.4MB in the beginning and 107.7MB in the end (delta: 88.7MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-03-19 02:52:08,021 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.32ms. Allocated memory was 181.4MB in the beginning and 240.1MB in the end (delta: 58.7MB). Free memory was 126.7MB in the beginning and 211.1MB in the end (delta: -84.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 240.1MB. Free memory was 211.1MB in the beginning and 210.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8959.89ms. Allocated memory is still 240.1MB. Free memory was 210.1MB in the beginning and 197.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 96741.92ms. Allocated memory is still 240.1MB. Free memory was 196.4MB in the beginning and 107.7MB in the end (delta: 88.7MB). Peak memory consumption was 89.3MB. 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: 97]: 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 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 96.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 95.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 42 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 94.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 87.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 109 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 66 NumberOfFragments, 404 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 02:52:08,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...